The core of games on k-regular set systems
AbstractIn the classical setting of cooperative game theory, it is always assumed that all coalitions are feasible. However in many real situations, there are restrictions on the set of coalitions, for example duo to communication, order or hierarchy on the set of players, etc. There are already many works dealing with games on restricted set of coalitions, defining many different structures for the set of feasible coalitions, called set systems. We propose in this paper to consider k-regular set systems, that is, set systems having all maximal chains of the same length k. This is somehow related to communication graphs. We study in this perspective the core of games defined on k-regular set systems. We show that the core may be unbounded and without vertices in some situations.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne in its series Documents de travail du Centre d'Economie de la Sorbonne with number 09055.
Length: 22 pages
Date of creation: Sep 2009
Date of revision: Oct 2009
Contact details of provider:
Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Cooperative game; feasible coalition; core.;
Other versions of this item:
- Lijue Xie & Michel Grabisch, 2009. "The core of games on k-regular set systems," UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers) halshs-00423922, HAL.
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-10-24 (All new papers)
- NEP-CDM-2009-10-24 (Collective Decision-Making)
- NEP-GTH-2009-10-24 (Game Theory)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Lucie Label).
If references are entirely missing, you can add them using this form.