A Ramsey Bound on Jordan Stable Sets

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.

MoreLess

Year of publication:	2009-03
Authors:	Kerber, Manfred ; Rowat, Colin
Institutions:	Department of Economics, University of Birmingham
Subject:	Pillage \| cooperative game theory \| stable sets

More details

Series:	Discussion Papers.
Type of publication:	Book / Working Paper
Language:	English
Notes:	4 pages
Classification:	C71 - Cooperative Games ; P14 - Property Rights
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10004972103