Article ID: | iaor2013282 |
Volume: | 76 |
Issue: | 3 |
Start Page Number: | 343 |
End Page Number: | 359 |
Publication Date: | Dec 2012 |
Journal: | Mathematical Methods of Operations Research |
Authors: | Estvez-Fernndez A, Fiestras-Janeiro M, Mosquera M, Snchez-Rodrguez E |
Keywords: | combinatorial analysis |
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.