Abstract
In this paper we establish a relationship between the core cover of a compromise admissible game and the core of a particular bankruptcy game: the core cover of a compromise admissible game is, indeed, a translation of the set of coalitionally stable allocations captured by an associated bankruptcy game. Moreover, we analyze the combinatorial complexity of the core cover and, consequently, of the core of a compromise stable game. © 2012 Springer-Verlag Berlin Heidelberg.
Original language | English |
---|---|
Pages (from-to) | 343-359 |
Number of pages | 26 |
Journal | Mathematical Methods of Operations Research |
Volume | 76 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2012 |
Keywords
- Cooperative game theory
- Compromise admissible games
- Bankruptcy
- Core cover
- Complexity