A note: characterizations of convex games by means of population monotonic allocation schemes

DOI10.1007/s00182-013-0408-4zbMath1308.91021OpenAlexW1974078543MaRDI QIDQ480849

Jesús Getán, Jesús Montes, Carles Rafels

Publication date: 12 December 2014

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-013-0408-4

zbMATH Keywords

extendabilitycooperative gameexactnessconvex gamepopulation monotonic allocation scheme

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Unnamed Item
• A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)
• Cores and large cores when population varies
• Population monotonic path schemes for simple games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Cooperative games with large cores
• Population monotonic allocation schemes for cooperative games with transferable utility
• Prosperty properties of TU-games
• Large cores and exactness
• A note on NTU convexity
• Cores of convex games
• Cores of exact games. I
• Introduction to the Theory of Cooperative Games

This page was built for publication: A note: characterizations of convex games by means of population monotonic allocation schemes