Article

International Journal of Game Theory

, Volume 40, Issue 3, pp 461-466

First online:

A Ramsey bound on stable sets in Jordan pillage games

  • Manfred KerberAffiliated withSchool of Computer Science, University of Birmingham
  • , Colin RowatAffiliated withDepartment of Economics, University of Birmingham Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Jordan (J Econ Theory 131(1):26–44, 2006) 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 provide a graph theoretical interpretation of the problem which tightens the finite bound to a Ramsey number. We also prove that the Jordan pillage axioms are independent.

Keywords

Pillage Cooperative game theory Stable sets

JEL Classification

C71 P14