CONVEX GAMES VERSUS CLAN GAMES

DOI10.1142/S0219198908001996zbMath1178.91017OpenAlexW3125063665MaRDI QIDQ5324556

Dinko Dimitrov, Rodica Branzei, S. H. Tijs

Publication date: 3 August 2009

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

Full work available at URL: https://doi.org/10.1142/s0219198908001996

zbMATH Keywords

coreWeber setconvex gamesmarginal gamesdual gamestotal clan games

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Unnamed Item
• Benefit sharing in holding situations
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Population monotonic allocation schemes for cooperative games with transferable utility
• Clan games
• Large cores and exactness
• Minimarg and maximarg operators
• Monotonic allocation schemes in clan games
• Cores of convex games
• Models in cooperative game theory. Crisp, fuzzy, and multi-choice games.

This page was built for publication: CONVEX GAMES VERSUS CLAN GAMES