Convex Multi-Choice Cooperative Games and their Monotonic Allocation Schemes

R. Brânzei, S.H. Tijs, J. Zarzuelo

Research output: Working paperDiscussion paperOther research output

397 Downloads (Pure)


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 languageEnglish
Place of PublicationTilburg
Number of pages12
Publication statusPublished - 2007

Publication series

NameCentER Discussion Paper


  • Multi-choice games
  • Convex games
  • Marginal games
  • Weber set
  • Monotonic allocation schemes.


Dive into the research topics of 'Convex Multi-Choice Cooperative Games and their Monotonic Allocation Schemes'. Together they form a unique fingerprint.

Cite this