Efficient solutions to multidimensional claims problem

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.