2026-07-21T12:28:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6793 2024-03-06T10:38:54Z ddc:004 open_access

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem Chan, T-H. Hubert Tang, Zhihao Gavin Wu, Xiaowei Max-Min Fair Allocation Hypergraph Matching We study the max-min fair allocation problem in which a set of m indivisible items are to be distributed among n agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item j on agent i is either 0 or some non-negative weight w_j. For this setting, Asadpour et al. [TALG, 2012] showed that a certain configuration-LP can be used to estimate the optimal value within a factor of 4 + delta, for any delta > 0, which was recently extended by Annamalai et al. [SODA 2015] to give a polynomial-time 13-approximation algorithm for the problem. For hardness results, Bezáková and Dani [SIGecom Exch., 2005] showed that it is NP-hard to approximate the problem within any ratio smaller than 2. In this paper we consider the (1, epsilon)-restricted max-min fair allocation problem, in which for some parameter epsilon in (0, 1), each item j is either heavy (w_j = 1) or light (w_j = epsilon). We show that the (1, epsilon)-restricted case is also NP-hard to approximate within any ratio smaller than 2. Hence, this simple special case is still algorithmically interesting. Using the configuration-LP, we are able to estimate the optimal value of the problem within a factor of 3 + delta, for any delta > 0. Extending this idea, we also obtain a quasi-polynomial time (3 + 4 epsilon)-approximation algorithm and a polynomial time 9-approximation algorithm. Moreover, we show that as epsilon tends to 0, the approximation ratio of our polynomial-time algorithm approaches 3 + 2 sqrt{2} approx 5.83. Schloss Dagstuhl – Leibniz-Zentrum für Informatik T-H. Hubert Chan and Zhihao Gavin Tang and Xiaowei Wu 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.23 urn:nbn:de:0030-drops-67939 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.23 eng https://creativecommons.org/licenses/by/3.0/legalcode