Abstract

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

Disciplines

Mathematics

Included in

Mathematics Commons

Share

COinS
 

URL: http://digitalcommons.calpoly.edu/rgp_rsr/46