Strong convexity of NTU games

DOI10.1007/S00182-012-0330-1zbMath1259.91018OpenAlexW2050574298MaRDI QIDQ444126

Takuya Masuzawa

Publication date: 13 August 2012

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

Full work available at URL: https://doi.org/10.1007/s00182-012-0330-1

zbMATH Keywords

corecooperative gameNTU gameconvex gamesuper-modularity

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (2)

Weighted values and the core in NTU games ⋮ Supermodular NTU-games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
• Convex games without side payments
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A note on NTU convexity
• Punishment strategies make the \(\alpha\)-coalitional game ordinally convex and balanced
• Cores of convex games
• Cores of Convex Games Without Side Payments

This page was built for publication: Strong convexity of NTU games