Improved Maximin Share Guarantee for Additive Valuations
By: Ehsan Heidari , Alireza Kaviani , Masoud Seddighin and more
Potential Business Impact:
Divides items fairly among people better.
The maximin share ($\textsf{MMS}$) is the most prominent share-based fairness notion in the fair allocation of indivisible goods. Recent years have seen significant efforts to improve the approximation guarantees for $\textsf{MMS}$ for different valuation classes, particularly for additive valuations. For the additive setting, it has been shown that for some instances, no allocation can guarantee a factor better than $1-\tfrac{1}{n^4}$ of maximin share value to all agents. However, the best currently known algorithm achieves an approximation guarantee of $\tfrac{3}{4} + \tfrac{3}{3836}$ for $\textsf{MMS}$. In this work, we narrow this gap and improve the best-known approximation guarantee for $\textsf{MMS}$ to $\tfrac{10}{13}$.
Similar Papers
Improved MMS Approximations for Few Agent Types
CS and Game Theory
Divides items fairly when people have similar tastes.
An FPTAS for 7/9-Approximation to Maximin Share Allocations
CS and Game Theory
Fairly divides items when people want different things.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
CS and Game Theory
Divides things fairly when people want different amounts.