Can I read Ordinal Maximin Share Approximation for Goods on EtoBox?

Ordinal Maximin Share Approximation for Goods by Hosseini, Hadi; Searns, Andrew; Segal-Halevi, Erel is a scholarly article available to read on EtoBox.

What is Ordinal Maximin Share Approximation for Goods about?

In fair division of indivisible goods, $\ell$-out-of-$d$ maximin share (MMS) is the value that an agent can guarantee by partitioning the goods into $d$ bundles and choosing the $\ell$ least preferred bundles. Most existing works aim to guarantee to all agents a constant fraction of their 1-out-of-$n$ MMS. But this guarantee is sensitive to small perturbation in agents' cardinal valuations. We consider a more robust approximation notion, which depends only on the agents' \emph{ordinal} rankings of bundles. We prove the existence of $\ell$-out-of-$\lfloor(\ell+\frac{1}{2})n\rfloor$ MMS allocations of goods for any integer $\ell\geq 1$, and present a polynomial-time algorithm that finds a $1$-out-of-$\lceil\frac{3n}{2}\rceil$ MMS allocation when $\ell = 1$. We further develop an algorithm that provides a weaker ordinal approximation to MMS for any $\ell > 1$.

Author

Hosseini, Hadi; Searns, Andrew; Segal-Halevi, Erel

Published

2021

Language

EN