Search

In fair division of indivisible goods, l-out-of-d maximin share (MMS) is the value that an agent can guarantee by partitioning the goods into d bundles and choosing the l 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' ordinal rankings of bundles. We prove the existence of l-out-of-;⌉(l + & #189;n#8970; MMS allocations of goods for any integer l ≥ 1, and present a polynomial-time algorithm that finds a 1-out-of-⌈3n/2;⌉ 1 MMS allocation when l = 1. We further develop an algorithm that provides a weaker ordinal approximation to MMS for any l > 1. [ABSTRACT FROM AUTHOR]