| Summary: | In the case of the proportional allocation of goods and burdens, the shares of all agents with respect to their values are equal, i.e., they form a constant sequence. In a degressively proportional allocation this sequence is nondecreasing when agents are increasingly ordered according to their values. The division performed according to this principle is ambiguous, and its selection requires many negotiations among participants. The aim of this paper is to limit the range of such negotiations when the problem is complex, i.e., the set of feasible solutions has high cardinality. It can be done thanks to a numerical analysis of the set of all feasible solutions, and eliminating allocations favoring or disfavoring some coalitions of agents. The problem is illustrated by the case study of allocating seats in the European Parliament in its 2019–2024 term.
|
|---|