The core of games on k-regular set systems

Abstract : 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.
Document type :
Other publications
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://halshs.archives-ouvertes.fr/halshs-00423922
Contributor : Lucie Label <>
Submitted on : Monday, October 26, 2009 - 10:02:58 AM
Last modification on : Tuesday, March 27, 2018 - 11:48:05 AM
Long-term archiving on : Wednesday, September 22, 2010 - 1:50:18 PM

File

09055-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-00423922, version 2

Collections

Citation

Lijue Xie, Michel Grabisch. The core of games on k-regular set systems. 2009. ⟨halshs-00423922v2⟩

Share

Metrics

Record views

147

Files downloads

132