Footnote:
Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments August 22, 2022 erstellt
Description:
In the random assignment problem, there is a set of agents and a set of the same number of indivisible objects. Each agent has a preference ordering over the objects. We seek a method of assigning one object to each agent, using some randomisation to achieve fairness. The central solutions are random priority and the serial rule. A key property of the serial rule is that it is envy-free. I propose a new fairness concept called the egalitarian criterion that is an application of the Rawlsian maximin principle. When combined with efficiency, it is incompatible with envy-freeness for groups of four or more. I also propose a new rule called the upper-equality rule that satisfies that new criterion, and an algorithm for that rule