Low communication protocols for fair allocation of indivisible goods

We study the multi-party randomized communication complexity of computing a fair allocation of m indivisible goods to n < m equally entitled agents. We first consider MMS allocations, allocations that give every agent at least her maximin share. Such allocations are guaranteed to exist for simple classes of valuation functions. We consider the expected number of bits that each agent needs to transmit, on average over all agents. For unit demand valuations, we show that this number is only O (1) (but (n), if one seeks EF1 allocations instead of MMS allocations), for binary additive valuations we show that it is (mn), and for 2-valued additive valuations we show a lower bound of (mn). For general additive valuations, MMS allocations need not exist. We consider a notion of approximately proportional (Aprop) allocations, that approximates proportional allocations in two different senses, being both Prop1 (proportional up to one item), and n2n-1-TPS (getting at least a n2n-1 fraction of the truncated proportional share, and hence also at least a n2n-1 fraction of the MMS). We design randomized protocols that output Aprop allocations, in which the expected average number of bits transmitted per agent is O (m). For the stronger notion of MXS (minimum EFX share) we show a lower bound of (mn).