English

On MMS, APS and XOS

Computer Science and Game Theory 2026-05-12 v1

Abstract

We consider allocations of a set of mm indivisible goods to nn agents of equal entitlements that have valuations from the class XOS. A previous sequence of works showed allocations that obtain an α\alpha-approximation for the maximin share (MMS), for values of α\alpha that gradually approach 14\frac{1}{4} from below (the currently known ratio is 417\frac{4}{17}). In this work we attempt to obtain ratios better than 14\frac{1}{4}, and manage to do so for sufficiently large nn. Our methodology is to first investigate the gap between the anyprice share (APS) and the MMS when all agents have the same XOS valuations, for which we design an allocation algorithm and prove that each agent receives at least α>1140\alpha > \frac{11}{40} times the APS. Then, we derive inspiration from this algorithm, and modify it so that it applies also when agents have different XOS valuations. Using this modified version, we show that for some sufficiently large n0n_0, there is an α\alpha-MMS allocation (in fact, an α\alpha-APS allocation) for every nn0n \geq n_0.

Keywords

Cite

@article{arxiv.2605.08859,
  title  = {On MMS, APS and XOS},
  author = {Uriel Feige and Vadim Grinberg},
  journal= {arXiv preprint arXiv:2605.08859},
  year   = {2026}
}
R2 v1 2026-07-01T12:59:48.893Z