Jordan [2006] defined ‘pillage games’, a class of cooperative games whose dominance operator represents a ‘power function’ constrained by monotonicity axioms. In this environment, he proved that stable sets must be finite. We bound their cardinality above by a Ramsey number and show this bound to be tight for two agents. More generally, it is not tight as it does not make use of structural information across partial orders on the stable set.
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.
Publisher Info
Paper provided by Department of Economics, University of Birmingham in its series Discussion Papers with number
09-01.
Find related papers by JEL classification: 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: