A Ramsey bound on stable sets in Jordan pillage games

DOI10.1007/S00182-010-0247-5MaRDI QIDQ637574zbMATH OpenOpenAlexFDO

Authors 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

cooperative game theorystable setspillage

Mathematics Subject Classification ID

Cooperative games (91A12)

Recommendations

• Stable sets in majority pillage games
• Pillage games with multiple stable sets
• Bounds on Ramsey games via alterations
• Strictly monotonic multidimensional sequences and stable sets in pillage games
• Zero-sum dynamic games and a stochastic variation of Ramsey's theorem
• CORE STABILITY OF DOMINATING SET GAMES
• Ideal games and Ramsey sets
• Stability of the core mapping in games with a countable set of players
• An N-M stable set of a regular game and its unique existence theorem
• scientific article; zbMATH DE number 4116340

Cites work

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

Cited in

(8)

• Efficient sets are small
• Asymmetric majority pillage games
• Strictly monotonic multidimensional sequences and stable sets in pillage games
• Stable sets in majority pillage games
• Sufficient conditions for unique stable sets in three agent pillage games
• Pillage games with multiple stable sets
• Cooperative games (von Neumann-Morgenstern stable sets)
• Bounds on Ramsey games via alterations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637574)