The core of games on k-regular set systems
In 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
|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
When requesting a correction, please mention this item's handle: RePEc:mse:cesdoc:09055. 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: (Lucie Label)
If references are entirely missing, you can add them using this form.