{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:20:35Z","timestamp":1783153235160,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","funder":[{"name":"The Science and Technology Development Fund (FDCT), Macau SAR","award":["0147\/2024\/RIA2, 0014\/2022\/AFJ, 0085\/2022\/A, and 001\/2024\/SKL"],"award-info":[{"award-number":["0147\/2024\/RIA2, 0014\/2022\/AFJ, 0085\/2022\/A, and 001\/2024\/SKL"]}]},{"name":"The Ministry of Education, Singapore","award":["RG98\/23"],"award-info":[{"award-number":["RG98\/23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792305","type":"proceedings-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:54:39Z","timestamp":1775771679000},"page":"157-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["All-but-one MMS Allocation for Chores"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9885-9408","authenticated-orcid":false,"given":"Jiawei","family":"Qiu","sequence":"first","affiliation":[{"name":"IOTSC, University of Macau, Macau, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-2115","authenticated-orcid":false,"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[{"name":"IOTSC, University of Macau, Macau, Macao"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0338-7162","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[{"name":"IOTSC, University of Macau, Macau, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9739-1308","authenticated-orcid":false,"given":"Shengwei","family":"Zhou","sequence":"additional","affiliation":[{"name":"SPMS, Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.11.059"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2023.0433"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Hannaneh Akrami Jugal Garg Eklavya Sharma and Setareh Taki. 2023a. Simplification and Improvement of MMS Approximation. In IJCAI. ijcai.org 2485-2493.","DOI":"10.24963\/ijcai.2023\/276"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Hannaneh Akrami Jugal Garg Eklavya Sharma and Setareh Taki. 2024. Improving Approximation Guarantees for Maximin Share. In EC. ACM 198.","DOI":"10.1145\/3670865.3673544"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Hannaneh Akrami Kurt Mehlhorn Masoud Seddighin and Golnoosh Shahkarami. 2023b. Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. In NeurIPS.","DOI":"10.52202\/075280-2565"},{"key":"e_1_3_2_1_7_1","first-page":"545","article-title":"Truthful Allocation Mechanisms Without Payments","author":"Amanatidis Georgios","year":"2017","unstructured":"Georgios Amanatidis, Georgios Birmpas, George Christodoulou, and Evangelos Markakis. 2017. Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. In EC. ACM, 545-562.","journal-title":"Characterization and Implications on Fairness. In EC. ACM"},{"key":"e_1_3_2_1_8_1","first-page":"31","article-title":"On Truthful Mechanisms for Maximin Share Allocations","author":"Amanatidis Georgios","year":"2016","unstructured":"Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. 2016. On Truthful Mechanisms for Maximin Share Allocations. In IJCAI. 31-37.","journal-title":"IJCAI."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01855-y"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Moshe Babaioff Tomer Ezra and Uriel Feige. 2021. Fair-Share Allocations for Agents with Arbitrary Entitlements. In EC. ACM 127.","DOI":"10.1145\/3465456.3467559"},{"key":"e_1_3_2_1_13_1","volume-title":"Fair Shares: Feasibility, Domination and Incentives. In EC. ACM, 435.","author":"Babaioff Moshe","year":"2022","unstructured":"Moshe Babaioff and Uriel Feige. 2022. Fair Shares: Feasibility, Domination and Incentives. In EC. ACM, 435."},{"key":"e_1_3_2_1_14_1","volume-title":"Sanath Kumar Krishna Murthy, and Yadati Narahari","author":"Barman Siddharth","year":"2018","unstructured":"Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, and Yadati Narahari. 2018. Groupwise Maximin Fair Allocation of Indivisible Goods. In AAAI. AAAI Press, 917-924."},{"key":"e_1_3_2_1_15_1","first-page":"1811","article-title":"Fair Division of Indivisible Goods Among Strategic Agents","author":"Barman Siddharth","year":"2019","unstructured":"Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, and Shivika Narang. 2019. Fair Division of Indivisible Goods Among Strategic Agents. In AAMAS. International Foundation for AAMAS, 1811-1813.","journal-title":"AAMAS. International Foundation for AAMAS"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381525"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-015-9287-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-08560-3_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11291"},{"key":"e_1_3_2_1_22_1","first-page":"626","article-title":"On picking sequences for chores","author":"Feige Uriel","year":"2023","unstructured":"Uriel Feige and Xin Huang. 2023. On picking sequences for chores. In EC. ACM, 626-655.","journal-title":"EC. ACM"},{"key":"e_1_3_2_1_23_1","volume-title":"Improved maximin fair allocation of indivisible items to three agents. CoRR","author":"Feige Uriel","year":"2022","unstructured":"Uriel Feige and Alexey Norkin. 2022. Improved maximin fair allocation of indivisible items to three agents. CoRR, Vol. abs\/2205.05363 (2022)."},{"key":"e_1_3_2_1_24_1","first-page":"355","article-title":"A Tight Negative Example for MMS Fair Allocations. In WINE (Lecture Notes in Computer Science, Vol. 13112)","author":"Feige Uriel","year":"2021","unstructured":"Uriel Feige, Ariel Sapir, and Laliv Tauber. 2021. A Tight Negative Example for MMS Fair Allocations. In WINE (Lecture Notes in Computer Science, Vol. 13112). Springer, 355-372.","journal-title":"Springer"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2019.07.005"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i13.33518"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3613452"},{"key":"e_1_3_2_1_28_1","first-page":"1","article-title":"Approximating Maximin Share Allocations. In SOSA (OASIcs, Vol. 69)","volume":"20","author":"Garg Jugal","year":"2019","unstructured":"Jugal Garg, Peter McGlaughlin, and Setareh Taki. 2019. Approximating Maximin Share Allocations. In SOSA (OASIcs, Vol. 69). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 20:1-20:11.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103547"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1096"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103633"},{"key":"e_1_3_2_1_32_1","volume-title":"On Representatives of Subsets. Journal of the London Mathematical Society","author":"Hall P.","year":"1935","unstructured":"P. Hall. 1935. On Representatives of Subsets. Journal of the London Mathematical Society, Vol. s1-10, 1 (1935), 26-30."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.81"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/34"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13317"},{"key":"e_1_3_2_1_36_1","first-page":"630","article-title":"An Algorithmic Framework for Approximating Maximin Share Allocation of Chores","author":"Huang Xin","year":"2021","unstructured":"Xin Huang and Pinyan Lu. 2021. An Algorithmic Framework for Approximating Maximin Share Allocation of Chores. In EC. ACM, 630-631.","journal-title":"EC. ACM"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Xin Huang and Erel Segal-Halevi. 2023. A Reduction from Chores Allocation to Job Scheduling. In EC. ACM 908.","DOI":"10.1145\/3580507.3597676"},{"key":"e_1_3_2_1_38_1","volume-title":"An FPTAS for 7\/9-Approximation to Maximin Share Allocations. CoRR","author":"Huang Xin","year":"2025","unstructured":"Xin Huang and Shengwei Zhou. 2025. An FPTAS for 7\/9-Approximation to Maximin Share Allocations. CoRR, Vol. abs\/2511.13056 (2025)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.115010"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Pooja Kulkarni Ruta Mehta and Parnian Shahkar. 2025. Online Fair Division: Towards Ex-Post Constant MMS Guarantees. In EC. ACM 638.","DOI":"10.1145\/3736252.3742604"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_1_42_1","volume-title":"Constant Weighted Maximin Share Approximations for Chores. CoRR","author":"Li Bo","year":"2025","unstructured":"Bo Li, Fangxiao Wang, and Shiji Xing. 2025. Constant Weighted Maximin Share Approximations for Chores. CoRR, Vol. abs\/2510.06581 (2025)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Bo Li Fangxiao Wang and Yu Zhou. 2023. Fair Allocation of Indivisible Chores: Beyond Additive Costs. In NeurIPS.","DOI":"10.52202\/075280-2368"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.104049"},{"key":"e_1_3_2_1_45_1","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus. 1948. The problem of fair division. Econometrica, Vol. 16 (1948), 101-104.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_46_1","volume-title":"On Fair Allocation of Indivisible Goods to Submodular Agents. CoRR","author":"Uziahu Gilad Ben","year":"2023","unstructured":"Gilad Ben Uziahu and Uriel Feige. 2023. On Fair Allocation of Indivisible Goods to Submodular Agents. CoRR, Vol. abs\/2303.12444 (2023)."},{"key":"e_1_3_2_1_47_1","unstructured":"Fangxiao Wang Bo Li and Pinyan Lu. 2024. Improved Approximation of Weighted MMS Fairness for Indivisible Chores. In IJCAI. ijcai.org 3014-3022."},{"key":"e_1_3_2_1_48_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"42516","author":"Zhou Shengwei","year":"2023","unstructured":"Shengwei Zhou, Rufan Bai, and Xiaowei Wu. 2023. Multi-agent Online Scheduling: MMS Allocations for Indivisible Items. In ICML (Proceedings of Machine Learning Research, Vol. 202). PMLR, 42506-42516."}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:04:50Z","timestamp":1783152290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":48,"alternative-id":["10.1145\/3774904.3792305","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792305","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}