{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T02:28:38Z","timestamp":1771381718600,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Science and Engineering Research Board","award":["SB\/S2\/RJN-128\/2015"],"award-info":[{"award-number":["SB\/S2\/RJN-128\/2015"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,20]]},"DOI":"10.1145\/3033274.3085136","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:21:49Z","timestamp":1497986509000},"page":"647-664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Approximation Algorithms for Maximin Fair Division"],"prefix":"10.1145","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanath Kumar","family":"Krishna Murthy","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_4"},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1357--1372","author":"Annamalai Chidambaram","year":"2014","unstructured":"Chidambaram Annamalai , Christos Kalaitzis , and Ola Svensson . 2014 . Combinatorial algorithm for restricted max-min fair allocation . In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1357--1372 . Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. 2014. Combinatorial algorithm for restricted max-min fair allocation. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1357--1372."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080723491"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","author":"Aziz H.","year":"2017","unstructured":"H. Aziz , Rauchecker, G., Schryen, G., and T. Walsh . 2017. Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods . Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence ( 2017 ). H. Aziz, Rauchecker, G., Schryen, G., and T. Walsh. 2017. Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (2017)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120680.1120683"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-015-9287-3"},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16)","author":"Bouveret Sylvain","year":"2016","unstructured":"Sylvain Bouveret and Michel Lematre . 2016 . Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences . In Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16) . Sylvain Bouveret and Michel Lematre. 2016. Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences. In Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1177\/1043463105058317"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_2_12_1","volume-title":"Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Operations Research","author":"Budish Eric","year":"2016","unstructured":"Eric Budish , G\u00e9rard P Cachon , Judd B Kessler , and Abraham Othman . 2016. Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Operations Research ( 2016 ). Eric Budish, G\u00e9rard P Cachon, Judd B Kessler, and Abraham Othman. 2016. Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Operations Research (2016)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748028"},{"key":"e_1_3_2_2_16_1","volume-title":"Randomized pipage rounding for matroid polytopes and applications. CoRR, abs\/0909.4348","author":"Chekuri Chandra","year":"2009","unstructured":"Chandra Chekuri and Jan Vondr\u00e1k . 2009. Randomized pipage rounding for matroid polytopes and applications. CoRR, abs\/0909.4348 ( 2009 ). Chandra Chekuri and Jan Vondr\u00e1k. 2009. Randomized pipage rounding for matroid polytopes and applications. CoRR, abs\/0909.4348 (2009)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347114"},{"key":"e_1_3_2_2_20_1","volume-title":"Fair Allocation of Indivisible Goods: Improvement and Generalization. arXiv preprint arXiv:1704.00222","author":"Ghodsi Mohammad","year":"2017","unstructured":"Mohammad Ghodsi , MohammadTaghi HajiAghayi , Masoud Seddighin , Saeed Seddighin , and Hadi Yami . 2017. Fair Allocation of Indivisible Goods: Improvement and Generalization. arXiv preprint arXiv:1704.00222 ( 2017 ). Mohammad Ghodsi, MohammadTaghi HajiAghayi, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. 2017. Fair Allocation of Indivisible Goods: Improvement and Generalization. arXiv preprint arXiv:1704.00222 (2017)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496829"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2728732.2728738"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496830"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI Press, 523--529","author":"Kurokawa David","year":"2016","unstructured":"David Kurokawa , Ariel D Procaccia , and Junxing Wang . 2016 . When can the maximin share guarantee be guaranteed? . In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI Press, 523--529 . David Kurokawa, Ariel D Procaccia, and Junxing Wang. 2016. When can the maximin share guarantee be guaranteed?. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI Press, 523--529."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/090750020"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-2727(90)90003-Z"},{"key":"e_1_3_2_2_29_1","volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin . 2004. Fair division and collective welfare . MIT press . Herv\u00e9 Moulin. 2004. Fair division and collective welfare. MIT press."},{"key":"e_1_3_2_2_30_1","volume-title":"Cooperative microeconomics: a game-theoretic introduction","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin . 2014. Cooperative microeconomics: a game-theoretic introduction . Princeton University Press . Herv\u00e9 Moulin. 2014. Cooperative microeconomics: a game-theoretic introduction. Princeton University Press."},{"key":"e_1_3_2_2_31_1","volume-title":"Handbook of Computational Social Choice","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin , Felix Brandt , Vincent Conitzer , Ulle Endriss , Ariel D Procaccia , and J\u00e9r\u00f4me Lang . 2016. Handbook of Computational Social Choice . Cambridge University Press . Herv\u00e9 Moulin, Felix Brandt, Vincent Conitzer, Ulle Endriss, Ariel D Procaccia, and J\u00e9r\u00f4me Lang. 2016. Handbook of Computational Social Choice. Cambridge University Press."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602835"},{"key":"e_1_3_2_2_33_1","volume-title":"The problem of fair division. Econometrica 16, 1","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus . 1948. The problem of fair division. Econometrica 16, 1 ( 1948 ). Hugo Steinhaus. 1948. The problem of fair division. Econometrica 16, 1 (1948)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/110832318"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(96)00055-7"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.032"}],"event":{"name":"EC '17: ACM Conference on Economics and Computation","location":"Cambridge Massachusetts USA","acronym":"EC '17","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2017 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3085136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:46Z","timestamp":1750217806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,20]]},"references-count":37,"alternative-id":["10.1145\/3033274.3085136","10.1145\/3033274"],"URL":"https:\/\/doi.org\/10.1145\/3033274.3085136","relation":{},"subject":[],"published":{"date-parts":[[2017,6,20]]},"assertion":[{"value":"2017-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}