{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:04Z","timestamp":1767338704071,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1122\/22"],"award-info":[{"award-number":["1122\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Aly Kaufman Fellowship","award":["0000"],"award-info":[{"award-number":["0000"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597783","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"626-655","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["On picking sequences for chores"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3749-4392","authenticated-orcid":false,"given":"Uriel","family":"Feige","sequence":"first","affiliation":[{"name":"Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9674-1994","authenticated-orcid":false,"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"Computer Science, Technion - Israel Institute of Technology, Haifa, -Select-, Israel"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Georgios Amanatidis Evangelos Markakis Afshin Nikzad and Amin Saberi. 2015. Approximation algorithms for computing maximin share allocations. In International Colloquium on Automata Languages and Programming. 39--51.  Georgios Amanatidis Evangelos Markakis Afshin Nikzad and Amin Saberi. 2015. Approximation algorithms for computing maximin share allocations. In International Colloquium on Automata Languages and Programming. 39--51.","DOI":"10.1007\/978-3-662-47672-7_4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/8"},{"key":"e_1_3_2_1_3_1","volume-title":"Algorithmic fair allocation of indivisible items: A survey and new questions. arXiv preprint arXiv:2202.08713","author":"Aziz Haris","year":"2022","unstructured":"Haris Aziz , Bo Li , Herve Moulin , and Xiaowei Wu. 2022b. Algorithmic fair allocation of indivisible items: A survey and new questions. arXiv preprint arXiv:2202.08713 ( 2022 ). Haris Aziz, Bo Li, Herve Moulin, and Xiaowei Wu. 2022b. Algorithmic fair allocation of indivisible items: A survey and new questions. arXiv preprint arXiv:2202.08713 (2022)."},{"key":"e_1_3_2_1_4_1","volume-title":"Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Mathematical Programming","author":"Aziz Haris","year":"2022","unstructured":"Haris Aziz , Bo Li , and Xiaowei Wu. 2022a. Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Mathematical Programming ( 2022 ), 1--27. Haris Aziz, Bo Li, and Xiaowei Wu. 2022a. Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Mathematical Programming (2022), 1--27."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298291"},{"key":"e_1_3_2_1_6_1","volume-title":"Best-of-Both-Worlds Fair-Share Allocations. CoRR abs\/2102.04909","author":"Babaioff Moshe","year":"2021","unstructured":"Moshe Babaioff , Tomer Ezra , and Uriel Feige . 2021a. Best-of-Both-Worlds Fair-Share Allocations. CoRR abs\/2102.04909 ( 2021 ). arXiv:2102.04909 https:\/\/arxiv.org\/abs\/2102.04909 Moshe Babaioff, Tomer Ezra, and Uriel Feige. 2021a. Best-of-Both-Worlds Fair-Share Allocations. CoRR abs\/2102.04909 (2021). arXiv:2102.04909 https:\/\/arxiv.org\/abs\/2102.04909"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467559"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381525"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219176"},{"key":"e_1_3_2_1_10_1","volume-title":"Almost Full EFX Exists for Four Agents. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022","author":"Berger Ben","year":"2022","unstructured":"Ben Berger , Avi Cohen , Michal Feldman , and Amos Fiat . 2022 . Almost Full EFX Exists for Four Agents. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022 . AAAI Press, 4826--4833. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/ 20410 Ben Berger, Avi Cohen, Michal Feldman, and Amos Fiat. 2022. Almost Full EFX Exists for Four Agents. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022. AAAI Press, 4826--4833. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/20410"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-015-9287-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12911"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399511"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467605"},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Web and Internet Economics. Springer, 355--372","author":"Feige Uriel","year":"2021","unstructured":"Uriel Feige , Ariel Sapir , and Laliv Tauber . 2021 . A tight negative example for MMS fair allocations . In International Conference on Web and Internet Economics. Springer, 355--372 . Uriel Feige, Ariel Sapir, and Laliv Tauber. 2021. A tight negative example for MMS fair allocations. In International Conference on Web and Internet Economics. Springer, 355--372."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.SOSA.2019.20"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399526"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103633"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467555"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_1_26_1","volume-title":"Fair Allocation of Indivisible Chores: Beyond Additive Valuations. arXiv preprint arXiv:2205.10520","author":"Li Bo","year":"2022","unstructured":"Bo Li , Fangxiao Wang , and Yu Zhou . 2022. Fair Allocation of Indivisible Chores: Beyond Additive Valuations. arXiv preprint arXiv:2205.10520 ( 2022 ). Bo Li, Fangxiao Wang, and Yu Zhou. 2022. Fair Allocation of Indivisible Chores: Beyond Additive Valuations. arXiv preprint arXiv:2205.10520 (2022)."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. 1678--1680","author":"Livanos Vasilis","year":"2022","unstructured":"Vasilis Livanos , Ruta Mehta , and Aniket Murhekar . 2022 . (Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna . In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. 1678--1680 . Vasilis Livanos, Ruta Mehta, and Aniket Murhekar. 2022. (Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. 1678--1680."}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597783","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":27,"alternative-id":["10.1145\/3580507.3597783","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597783","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}