Efficient Solutions to Multidimensional Claims Problem

Sijia Xu and Peng Liu ()
Additional contact information
Sijia Xu: East China University of Science and Technology, Shanghai 200237, China
Peng Liu: East China Normal University, Shanghai 200062, China

Games, 2025, vol. 16, issue 5, 1-9

Abstract: In this paper, we study the multidimensional claims problem and introduce the eating algorithm to this problem. It is shown that a solution is efficient if and only if it is the outcome of the eating algorithm with a profile of specific eating functions. Moreover, we adapt three classical solutions, i.e., the constrained equal awards rule, constrained equal losses rule, and proportional rule, to the current setting and show that they are special cases of the eating algorithm with specific eating functions.

Keywords: multidimensional claims problem; efficiency; eating algorithm (search for similar items in EconPapers)
JEL-codes: C C7 C70 C71 C72 C73 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2073-4336/16/5/51/pdf (application/pdf)
https://www.mdpi.com/2073-4336/16/5/51/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jgames:v:16:y:2025:i:5:p:51-:d:1766964

Access Statistics for this article

Games is currently edited by Ms. Susie Huang

More articles in Games from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().