Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477227 | European Journal of Operational Research | 2009 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
R. Branzei, S. Tijs, J. Zarzuelo,