Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
Penny Haxell, Tibor Szab\'o

TL;DR
This paper introduces topological methods to improve the integrality gap bounds for the Santa Claus problem, a max-min resource allocation challenge, surpassing previous combinatorial approaches.
Contribution
It replaces combinatorial augmenting tree arguments with topological techniques, achieving a better integrality gap bound of 3.534 for the Configuration LP.
Findings
Improved integrality gap from 3.808 to 3.534.
Topological methods effectively replace combinatorial arguments.
Enhanced bounds for the restricted version with two resource values.
Abstract
In the max-min allocation problem a set of players are to be allocated disjoint subsets of a set of indivisible resources, such that the minimum utility among all players is maximized. We study the restricted variant, also known as the Santa Claus problem, where each resource has an intrinsic positive value, and each player covets a subset of the resources. Bez\'akov\'a and Dani showed that this problem is NP-hard to approximate within a factor less than , consequently a great deal of work has focused on approximate solutions. The principal approach for obtaining approximation algorithms has been via the Configuration LP (CLP) of Bansal and Sviridenko. Accordingly, there has been much interest in bounding the integrality gap of this CLP. The existing algorithms and integrality gap estimations are all based one way or another on the combinatorial augmenting tree argument of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Complexity and Algorithms in Graphs · Advanced Graph Theory Research
