Abstract
A well-known result related to bankruptcy problems establishes that a vector is a bankruptcy allocation if and only if it belongs to the core of the associated O’Neill’s bankruptcy game. In this paper we show that this game is precisely the unique TU-game based on convex functions that satisfies the previous result. In addition, given a bankruptcy problem, we show a way for constructing bankruptcy games such that the set of bankruptcy allocations is a subset of their core or their core is a subset of the set of bankruptcy allocations. Also, we show how these results can be applied for finding new bankruptcy solutions.
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 callDisclaimer: 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.
