Bad News for Couples: Bounds for Fair Division of Indivisible Items among Groups

Abstract

We consider the problem of fairly allocating indivisible items to couples, where each couple consists of two agents with distinct additive valuations. We show that there exist binary instances with $n$ agents partitioned into $n/2$ couples for which envy-freeness up to $\Omega(\sqrt{n})$ items cannot be guaranteed. More generally, in the group-allocation model with $n$ agents partitioned into $k$ groups, we construct binary instances for which envy-freeness up to $\Omega(\sqrt{n-k})$ items cannot be guaranteed. This matches the $O(\sqrt{n})$ upper bound of Manurangsi and Suksompong in all regimes except when $n-k \ll n$, that is, when most agents form singleton groups and only a sublinear number of agents belong to groups of size at least two. This result is somewhat surprising, as that upper bound was conjectured not to be tight for instances consisting only of small groups, such as couples. We complement our lower bound with improved upper bounds for the remaining sparse regime. For prime-power $k$, we prove an upper bound of $O(\min\{\sqrt{(n-k)\log k},n-k\})$. For arbitrary $k$, the bound incurs an additional factor of $O(\frac{\log m}{\log k})$ where $m$ is the number of items. The result follows from a more general theorem that simultaneously guarantees approximate envy-freeness with respect to agents' subjective valuations and approximate equality with respect to multiple consensus valuations.