Ensuring the boundedness of the core of games with restricted cooperation
The core of a cooperative game on a set of players $N$ is one of the most popular concepts of solution. When cooperation is restricted (feasible coalitions form a subcollection $\cF$ of $2^N$), the core may become unbounded, which makes its usage questionable in practice. Our proposal is to make the core bounded by turning some of the inequalities defining the core into equalities (additional efficiency constraints). We address the following mathematical problem: can we find a minimal set of inequalities in the core such that, if turned into equalities, the core becomes bounded? The new core obtained is called the restricted core. We completely solve the question when $\cF$ is a distributive lattice, introducing also the notion of restricted Weber set. We show that the case of regular set systems amounts more or less to the case of distributive lattices. We also study the case of weakly union-closed systems and give some results for the general case.
|Date of creation:||2011|
|Date of revision:|
|Publication status:||Published, Annals of Operations Research, 2011, 137-154|
|Note:||View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00650964|
|Contact details of provider:|| Web page: http://hal.archives-ouvertes.fr/|
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:hal-00650964. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.