Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores

Jiawei Qiu, Xiaowei Wu, Cong Zhang, Shengwei Zhou

Abstract: We study the problem of allocating $m$ indivisible chores to $n$ agents with additive cost functions under the fairness notion of maximin share (MMS). In this work, we propose a notion called $\alpha$-approximate all-but-one maximin share ($\alpha$-AMMS) which is a stronger version of $\alpha$-approximate MMS. An allocation is called $\alpha$-AMMS if $n-1$ agents are guaranteed their MMS values and the remaining agent is guaranteed $\alpha$-approximation of her MMS value. We show that there exist $\alpha$-AMMS allocations, with $\alpha = 9/8$ for three agents; $\alpha = 4/3$ for four agents; and $\alpha = (n+1)^2/4n$ for $n\geq 5$ agents.