Abstract
This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Further- more, (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 ex- tendable to a limas, and the (total) Shapley value for multi-choice games generates a limas for each convex multi-choice game.
| Original language | English |
|---|---|
| Pages (from-to) | 571-575 |
| Journal | European Journal of Operational Research |
| Volume | 198 |
| Issue number | 2 |
| Publication status | Published - 2009 |