Convex multi-choice games: Characterizations and monotonic allocation schemes.(Report) Branzei, R.; Tijs, S.; Zarzuelo, J.

User activity

Share to:
View the summary of this work
Branzei, R. ; Tijs, S. ; Zarzuelo, J.
Appears In
European Journal of Operational Research
Business, general; Business, international; Business
Academic; Trade
To link to full-text access for this article, visit this link: Byline: R. Branzei (a), S. Tijs (b), J. Zarzuelo (c) Keywords: Multi-choice games; Convex games; Marginal games; Weber set; Monotonic allocation schemes 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. Author Affiliation: (a) Faculty of Computer Science, Alexandru Ioan Cuza University, IaAi, Romania (b) CentER and Department of Econometrics and Operations Research, Tilburg University, The Netherlands (c) Department of Applied Economics IV, Faculty of Economics and Business Administration Basque Country University, Bilbao, Spain Article History: Received 3 April 2008; Accepted 24 September 2008
Work ID

2 editions of this work

Find a specific edition
Thumbnail [View as table] [View as grid] Title, Author, Edition Date Language Format Libraries

User activity

e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this work

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this work

Add a comment

Show comments and reviews from Amazon users