Strictly monotonic multidimensional sequences and stable sets in pillage games

DOI10.1016/j.jcta.2010.07.003zbMath1227.05251arXiv1004.0433OpenAlexW1983243620MaRDI QIDQ618306

David Saxton

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.0433

zbMATH Keywords

pillage gamesErdős-Szekeresstrictly monotonic sequences

Mathematics Subject Classification ID

Cooperative games (91A12) Extremal set theory (05D05) Ramsey theory (05D10)

Related Items (5)

Efficient sets are small ⋮ Pillage games with multiple stable sets ⋮ Asymmetric majority pillage games ⋮ A Ramsey bound on stable sets in Jordan pillage games ⋮ Sufficient conditions for unique stable sets in three agent pillage games

Cites Work

• Pillage and property
• An extremal problem for sets with applications to graph theory
• Constructive lower bounds on classical multicolor Ramsey numbers
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Monotonic Subsequences
• Combinatorial Relations and Chromatic Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Strictly monotonic multidimensional sequences and stable sets in pillage games