Convex multi-choice games: Characterizations and monotonic allocation schemes
This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Furthermore, level-increase monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element of the Weber set of such a game is extendable to a limas, and the (total) Shapley value for multi-choice games generates a limas for each convex multi-choice game.
Year of publication: |
2009
|
---|---|
Authors: | Branzei, R. ; Tijs, S. ; Zarzuelo, J. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 198.2009, 2, p. 571-575
|
Publisher: |
Elsevier |
Keywords: | Multi-choice games Convex games Marginal games Weber set Monotonic allocation schemes |
Saved in:
Saved in favorites
Similar items by person
-
Convex multi-choice games: Characterizations and monotonic allocation schemes
Branzei, R., (2009)
-
Set-valued solution concepts using interval-type payoffs for interval games
Alparslan Gök, S.Z., (2011)
-
A constrained egalitarian solution for convex multi-choice games
Branzei, R., (2014)
- More ...