Equitable distribution of indivisible objects

Abstract Deterministic and randomized solutions are developed for the problem of equitably distributing m indivisible objects to n people (whose values may differ), without the use of outside judges or side-payments. Several general bounds for the minimal share are found; a practical method is given for determining an optimal lottery and the largest minimal share; and the case of repeated allocations is analyzed.