{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:23Z","timestamp":1783576883069,"version":"3.55.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:00:00Z","timestamp":1495756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"School of Basic Sciences, EPFL"},{"name":"ERC Starting","award":["335288-OptApprox"],"award-info":[{"award-number":["335288-OptApprox"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2017,7,31]]},"abstract":"<jats:p>We study the basic allocation problem of assigning resources to players to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain Configuration-LP can be used to estimate the value of the optimal allocation to within a factor of 4+ \u03b5. In contrast, however, the best-known approximation algorithm for the problem has an unspecified large constant guarantee.<\/jats:p>\n          <jats:p>\n            In this article, we significantly narrow this gap by giving a 13-approximation algorithm for the problem. Our approach develops a local search technique introduced by Haxell [13] for hypergraph matchings and later used in this context by Asadpour, Feige, and Saberi [2]. For our local search procedure to terminate in polynomial time, we introduce several new ideas, such as\n            <jats:italic>lazy updates<\/jats:italic>\n            and\n            <jats:italic>greedy players<\/jats:italic>\n            . Besides the improved approximation guarantee, the highlight of our approach is that it is purely combinatorial and uses the Configuration-LP only in the analysis.\n          <\/jats:p>","DOI":"10.1145\/3070694","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T19:32:40Z","timestamp":1496259160000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Combinatorial Algorithm for Restricted Max-Min Fair Allocation"],"prefix":"10.1145","volume":"13","author":[{"given":"Chidambaram","family":"Annamalai","sequence":"first","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Kalaitzis","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,5,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Chidambaram Annamalai. 2016. Finding perfect matchings in bipartite hypergraphs. To appear in Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (2016).   Chidambaram Annamalai. 2016. Finding perfect matchings in bipartite hypergraphs. To appear in Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (2016).","DOI":"10.1137\/1.9781611974331.ch126"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229168"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250808"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536488"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120680.1120683"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748028"},{"key":"e_1_2_1_8_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms 3rd ed. MIT Press. Retrieved from http:\/\/mitpress.mit.edu\/books\/introduction-algorithms.   Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms 3rd ed. MIT Press. Retrieved from http:\/\/mitpress.mit.edu\/books\/introduction-algorithms."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 287--293","author":"Feige Uriel","year":"2008"},{"key":"e_1_2_1_10_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"2","author":"Feige Uriel","year":"2008"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the London Mathematical Society s2-17","author":"Hardy G. H.","year":"1918"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01793010"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_61"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the International Conference on Supercomputing (ICS\u201910)","author":"Saha Barna","year":"2010"},{"key":"e_1_2_1_17_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency.","author":"Schrijver Alexander","year":"2002"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/110851201"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3070694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3070694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:27Z","timestamp":1750217427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3070694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,26]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7,31]]}},"alternative-id":["10.1145\/3070694"],"URL":"https:\/\/doi.org\/10.1145\/3070694","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,26]]},"assertion":[{"value":"2015-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}