On MMS, APS and XOS
Abstract
We consider allocations of a set of m indivisible goods to n agents of equal entitlements that have valuations from the class XOS. A previous sequence of works showed allocations that obtain an α-approximation for the maximin share (MMS), for values of α that gradually approach 14 from below (the currently known ratio is 417). In this work we attempt to obtain ratios better than 14, and manage to do so for sufficiently large n. 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 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 n0, there is an α-MMS allocation (in fact, an α-APS allocation) for every n ≥ n0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.