Convex multi-choice cooperative games and their monotonic allocation schemes

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

Research output: Contribution to journalArticleScientificpeer-review

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)571-575
JournalEuropean Journal of Operational Research
Volume198
Issue number2
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'Convex multi-choice cooperative games and their monotonic allocation schemes'. Together they form a unique fingerprint.

Cite this