A Ramsey bound on stable sets in Jordan pillage games
Jordan  defined ‘pillage games’, a class of cooperative games whose dominance operator is represented by a ‘power function’ satisfying coalitional and resource monotonicity axioms. In this environment, he proved that stable sets must be finite. We use graph theory to reinterpret this result, tightening the bound, highlighting the role played by resource monotonicity, and suggesting a strategy for yet tighter bounds.
(This abstract was borrowed from another version of this item.)
Volume (Year): 40 (2011)
Issue (Month): 3 (August)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Manfred Kerber & Colin Rowat, 2009. "Stable Sets in Three Agent Pillage Games," Discussion Papers 09-07, Department of Economics, University of Birmingham.
- Jordan, J.S., 2006. "Pillage and property," Journal of Economic Theory, Elsevier, vol. 131(1), pages 26-44, November.
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:40:y:2011:i:3:p:461-466. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.