Pocedures for Random Division of a Set of Indivisible Googs

Abstract

In fair distribution of a set of indivisible goods it is problematic to provide basic equality if the goods differ in value. One of the most popular solutions to the problems are lotteries. The paper presents seven selected probabilistic procedures: random distribution, lexicographic procedure of equal chances of satisfaction, random serial dictatorship, core from random endowments, probabilistic serial, top trading cycles from equal division and random priority with infi nite k factor. Some of these procedures always lead to the same result as some other procedure, therefore these procedures are equivalent. The formal features of the procedures are also analysed in the paper: ordinal efficiency, ex post efficiency, and both strong and week version of: envy-freeness, proportionality, equitability, and individual strategy-proofness.