A Ramsey bound on stable sets in Jordan pillage games

DOI10.1007/s00182-010-0247-5zbMath1231.91014OpenAlexW3121279379MaRDI QIDQ637574

Manfred Kerber, Colin Rowat

Publication date: 6 September 2011

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

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/20008211/final.pdf

zbMATH Keywords

stable setscooperative game theorypillage

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (5)

Efficient sets are small ⋮ Pillage games with multiple stable sets ⋮ Asymmetric majority pillage games ⋮ Sufficient conditions for unique stable sets in three agent pillage games ⋮ Cooperative Games (Von Neumann-Morgenstern Stable Sets)

Cites Work

• Strictly monotonic multidimensional sequences and stable sets in pillage games
• Pillage and property
• Constructive lower bounds on classical multicolor Ramsey numbers
• Sufficient conditions for unique stable sets in three agent pillage games
• Combinatorial optimization. Theory and applications.
• Solutions of irreflexive relations

This page was built for publication: A Ramsey bound on stable sets in Jordan pillage games