Stable Sets in Three Agent Pillage Games
AbstractJordan [2006, “Pillage and property”, JET] characterises stable sets for three special cases of ‘pillage games’. For anonymous, three agent pillage games we show that: when the core is non-empty, it must take one of five forms; all such pillage games with an empty core represent the same dominance relation; when a stable set exists, and the game also satisfies a continuity and a responsiveness assumption, it is unique and contains no more than 15 elements. This result uses a three step procedure: first, if a single agent can defend all of the resources against the other two, these allocations belong to the stable set; dominance is then transitive on the loci of allocations on which the most powerful agent can, with any ally, dominate the third, adding the maximal elements of this set to the stable set; finally, if any allocations remain undominated or not included, the game over the remaining allocations is equivalent to the ‘majority pillage game’, which has a unique stable set [Jordan and Obadia, 2004, “Stable sets in majority pillage games”, mimeo]. Non-existence always reflects conditions on the loci of allocations along which the most powerful agent needs an ally. The analysis unifies the results in Jordan  when n = 3.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Economics, University of Birmingham in its series Discussion Papers with number 09-07.
Length: 29 pages
Date of creation: Jun 2009
Date of revision:
pillage; cooperative game theory; core; stable sets; algorithm;
Find related papers by JEL classification:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- P14 - Economic Systems - - Capitalist Systems - - - Property Rights
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-07-17 (All new papers)
- NEP-CDM-2009-07-17 (Collective Decision-Making)
- NEP-GTH-2009-07-17 (Game Theory)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Manfred Kerber & Colin Rowat, 2009.
"A Ramsey Bound on Stable Sets in Jordan Pillage Games,"
09-01r, Department of Economics, University of Birmingham.
- Manfred Kerber & Colin Rowat, 2011. "A Ramsey bound on stable sets in Jordan pillage games," International Journal of Game Theory, Springer, vol. 40(3), pages 461-466, August.
- Manfred Kerber & Colin Rowat, 2012. "Sufficient Conditions for the Unique Stable Sets in Three Agent Pillage Games," Discussion Papers 12-11, Department of Economics, University of Birmingham.
- Simon MacKenzie & Manfred Kerber & Colin Rowat, 2013. "Pillage Games with Multiple Stable Sets," Discussion Papers 13-07, Department of Economics, University of Birmingham.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Colin Rowat).
If references are entirely missing, you can add them using this form.