{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:19Z","timestamp":1751516239709,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742621","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"764-782","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1089-5779","authenticated-orcid":false,"given":"Masoud","family":"Seddighin","sequence":"first","affiliation":[{"name":"Tehran Institute for Advanced Studies, Tehran, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3951-7096","authenticated-orcid":false,"given":"Saeed","family":"Seddighin","sequence":"additional","affiliation":[{"name":"Unaffiliated, Chicago, Illinois, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.4"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/276"},{"key":"e_1_3_2_2_3_1","volume-title":"Randomized and deterministic maximin-share approximations for fractionally subadditive valuations. Advances in Neural Information Processing Systems 36","author":"Akrami Hannaneh","year":"2024","unstructured":"Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, and Golnoosh Shahkarami. 2024. Randomized and deterministic maximin-share approximations for fractionally subadditive valuations. Advances in Neural Information Processing Systems 36 (2024)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147173"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085125"},{"key":"e_1_3_2_2_9_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649740"},{"key":"e_1_3_2_2_11_1","volume-title":"How to cut a cake fairly. American mathematical monthly","author":"Dubins Lester E","year":"1961","unstructured":"Lester E Dubins and Edwin H Spanier. 1961. How to cut a cake fairly. American mathematical monthly (1961), 1\u201317."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90005-2"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 1535\u20131537","author":"Farhadi Alireza","year":"2017","unstructured":"Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sebastien Lahaie, David Pennock, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. 2017. Fair Allocation of Indivisible Goods to Asymmetric Agents. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 1535\u20131537."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399526"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_2_17_1","volume-title":"On representatives of subsets. Classic Papers in Combinatorics","author":"Hall Philip","year":"1987","unstructured":"Philip Hall. 1987. On representatives of subsets. Classic Papers in Combinatorics (1987), 58\u201362."},{"key":"e_1_3_2_2_18_1","volume-title":"Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations. arXiv preprint arXiv:2407.05139","author":"Kaviani Alireza","year":"2024","unstructured":"Alireza Kaviani, Masoud Seddighin, and AmirMohammad Shahrezaei. 2024. Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations. arXiv preprint arXiv:2407.05139 (2024)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Jack Robertson and William Webb. 1998. Cake-cutting algorithms: Be fair if you can. AK Peters\/CRC Press.","DOI":"10.1201\/9781439863855"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313670"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.104049"},{"key":"e_1_3_2_2_24_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)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995109"}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:50:24Z","timestamp":1751482224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":25,"alternative-id":["10.1145\/3736252.3742621","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742621","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}