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 coalitional 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.