This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Stable Sets in Three Agent Pillage Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Manfred Kerber
Colin Rowat

Additional information is available for the following registered author(s):

Abstract

Jordan [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 [2006] when n = 3.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: ftp://ftp.bham.ac.uk/pub/RePEc/pdf/09-07.pdf
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by Department of Economics, University of Birmingham in its series Discussion Papers with number 09-07.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 29 pages
Date of creation: Jun 2009
Date of revision:
Handle: RePEc:bir:birmec:09-07

Contact details of provider:
Postal: Edgbaston, Birmingham, B15 2TT
Web page: http://www.economics.bham.ac.uk
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Colin Rowat).

Related research
Keywords: pillage; cooperative game theory; core; stable sets; algorithm;

Find related papers by JEL classification:
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - 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:

Statistics
Access and download statistics

Did you know? You may want to explore EconPapers, which displays the same data as IDEAS in a different way.

This page was last updated on 2009-11-19.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.