Ordinal Maximin Guarantees for Group Fair Division

Abstract

We investigate fairness in the allocation of indivisible items among groups of agents using the notion of maximin share (MMS). While previous work has shown that no nontrivial multiplicative MMS approximation can be guaranteed in this setting for general group sizes, we demonstrate that ordinal relaxations are much more useful. For example, we show that if $n$ agents are distributed equally across $g$ groups, there exists a $1$-out-of-$k$ MMS allocation for $k=O(g\log (n/g))$, while if all but a constant number of agents are in the same group, we obtain $k=O(\log n/\log \log n)$. We also establish the tightness of these bounds and provide non-asymptotic results for the case of two groups.

arXiv commentAppears in the 33rd International Joint Conference on Artificial Intelligence (IJCAI), 2024

References in corpus (12)

• Almost Envy-Freeness in Group Resource Allocation
• Asymptotic Existence of Fair Divisions for Groups
• Democratic Fair Allocation of Indivisible Goods
• Approximate Maximin Shares for Groups of Agents
• Fair Cake-Cutting among Families
• Mind the Gap: Cake Cutting With Separation
• How to Cut a Cake Fairly: A Generalization to Groups
• Ordinal Maximin Share Approximation for Goods
• Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory
• Cutting a Cake Fairly for Groups Revisited
• Consensus-Halving: Does It Ever Get Easier?
• Keep Your Distance: Land Division With Separation