{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T06:48:34Z","timestamp":1767422914452,"version":"3.41.0"},"reference-count":100,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>The theory of algorithmic fair allocation is at the center of multi-agent systems and economics in recent decades due to its industrial and social importance. At a high level, the problem is to assign a set of items that are either goods or chores to a set of agents so that every agent is happy with what she obtains. In this survey, we focus on indivisible items, for which exact fairness as measured by envy-freeness and proportionality cannot be guaranteed. One main theme in the recent research agenda is designing algorithms that approximately achieve fairness criteria. We aim at presenting a comprehensive survey of recent progress through the prism of algorithms, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.<\/jats:p>","DOI":"10.1145\/3572885.3572887","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T17:05:57Z","timestamp":1669655157000},"page":"24-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Algorithmic fair allocation of indivisible items"],"prefix":"10.1145","volume":"20","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[{"name":"UNSW Sydney"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University"}]},{"given":"Herv\u00e9","family":"Moulin","sequence":"additional","affiliation":[{"name":"University of Glasgow"}]},{"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Macau"}]}],"member":"320","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i09.7081"},{"key":"e_1_2_1_2_1","first-page":"31","volume-title":"IJCAI","author":"Amanatidis Georgios","year":"2016","unstructured":"Georgios Amanatidis , Georgios Birmpas , and Evangelos Markakis . On truthful mechanisms for maximin share allocations . In IJCAI , pages 31 -- 37 , 2016 . Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. On truthful mechanisms for maximin share allocations. In IJCAI, pages 31--37, 2016."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085147"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147173"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304423"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.07.006"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.020"},{"key":"e_1_2_1_8_1","first-page":"149","volume-title":"WINE","volume":"13112","author":"Amanatidis Georgios","year":"2021","unstructured":"Georgios Amanatidis , Georgios Birmpas , Federico Fusco , Philip Lazos , Stefano Leonardi , and Rebecca Reiffenh\u00e4user . Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness . In WINE , volume 13112 , pages 149 -- 166 , 2021 b. Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, and Rebecca Reiffenh\u00e4user. Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness. In WINE, volume 13112, pages 149--166, 2021b."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i09.7082"},{"key":"e_1_2_1_10_1","first-page":"341","volume-title":"WINE","volume":"12495","author":"Aziz Haris","year":"2020","unstructured":"Haris Aziz . Simultaneously achieving ex-ante and ex-post fairness . In WINE , volume 12495 , pages 341 -- 355 , 2020 b. Haris Aziz. Simultaneously achieving ex-ante and ex-post fairness. In WINE, volume 12495, pages 341--355, 2020b."},{"key":"e_1_2_1_11_1","volume-title":"The vigilant eating rule: A general approach for probabilistic economic design with constraints. CoRR, abs\/2008.08991","author":"Aziz Haris","year":"2020","unstructured":"Haris Aziz and Florian Brandl . The vigilant eating rule: A general approach for probabilistic economic design with constraints. CoRR, abs\/2008.08991 , 2020 . Haris Aziz and Florian Brandl. The vigilant eating rule: A general approach for probabilistic economic design with constraints. CoRR, abs\/2008.08991, 2020."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.52"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.06.002"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10586"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/7"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/9"},{"key":"e_1_2_1_18_1","volume-title":"Approximate and strategyproof maximin share allocation of chores with ordinal preferences. CoRR, abs\/2012.13884","author":"Aziz Haris","year":"2020","unstructured":"Haris Aziz , Bo Li , and Xiaowei Wu . Approximate and strategyproof maximin share allocation of chores with ordinal preferences. CoRR, abs\/2012.13884 , 2020 a. Haris Aziz, Bo Li, and Xiaowei Wu. Approximate and strategyproof maximin share allocation of chores with ordinal preferences. CoRR, abs\/2012.13884, 2020a."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.07.005"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-021-09532-8"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467559"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1062"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/4"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011748"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381525"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219176"},{"key":"e_1_2_1_29_1","volume-title":"AAMAS","author":"Barman Siddharth","year":"2019","unstructured":"Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , and Shivika Narang . Fair division of indivisible goods among strategic agents . In AAMAS , 2019 . Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, and Shivika Narang. Fair division of indivisible goods among strategic agents. In AAMAS, 2019."},{"key":"e_1_2_1_30_1","first-page":"356","volume-title":"WINE","author":"Barman Siddharth","year":"2020","unstructured":"Siddharth Barman , Umang Bhaskar , and Nisarg Shah . Optimal bounds on the price of fairness for indivisible goods . In WINE , pages 356 -- 369 , 2020 . Siddharth Barman, Umang Bhaskar, and Nisarg Shah. Optimal bounds on the price of fairness for indivisible goods. In WINE, pages 356--369, 2020."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103436"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-021-09517-7"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-021-10039-8"},{"key":"e_1_2_1_34_1","volume-title":"abs\/2102.10654","author":"Berger Ben","year":"2021","unstructured":"Ben Berger , Avi Cohen , Michal Feldman , and Amos Fiat . (almost full) EFX exists for four agents (and beyond). CoRR , abs\/2102.10654 , 2021 . Ben Berger, Avi Cohen, Michal Feldman, and Amos Fiat. (almost full) EFX exists for four agents (and beyond). CoRR, abs\/2102.10654, 2021."},{"key":"e_1_2_1_35_1","volume-title":"APPROX-RANDOM","author":"Bhaskar Umang","year":"2021","unstructured":"Umang Bhaskar , A. R. Sricharan , and Rohit Vaish . On approximate envy-freeness for indivisible chores and mixed resources . In APPROX-RANDOM , 2021 . Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. On approximate envy-freeness for indivisible chores and mixed resources. In APPROX-RANDOM, 2021."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA14564"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-018-1157-x"},{"key":"e_1_2_1_39_1","volume-title":"Bhaskar Ray Chaudhury, and Ruta Mehta. Polynomial time algorithms to find an approximate competitive equilibrium for chores. CoRR, abs\/2107.06649","author":"Boodaghians Shant","year":"2021","unstructured":"Shant Boodaghians , Bhaskar Ray Chaudhury, and Ruta Mehta. Polynomial time algorithms to find an approximate competitive equilibrium for chores. CoRR, abs\/2107.06649 , 2021 . Shant Boodaghians, Bhaskar Ray Chaudhury, and Ruta Mehta. Polynomial time algorithms to find an approximate competitive equilibrium for chores. CoRR, abs\/2107.06649, 2021."},{"key":"e_1_2_1_40_1","first-page":"73","volume-title":"IJCAI","author":"Bouveret Sylvain","year":"2011","unstructured":"Sylvain Bouveret and J\u00e9r\u00f4me Lang . A general elicitation-free protocol for allocating indivisible goods . In IJCAI , pages 73 -- 78 , 2011 . Sylvain Bouveret and J\u00e9r\u00f4me Lang. A general elicitation-free protocol for allocating indivisible goods. In IJCAI, pages 73--78, 2011."},{"key":"e_1_2_1_41_1","first-page":"141","volume-title":"ECAI","author":"Bouveret Sylvain","year":"2014","unstructured":"Sylvain Bouveret and J\u00e9r\u00f4me Lang . Manipulating picking sequences . In ECAI , pages 141 -- 146 , 2014 . Sylvain Bouveret and J\u00e9r\u00f4me Lang. Manipulating picking sequences. In ECAI, pages 141--146, 2014."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_2_1_43_1","volume-title":"The win-win solution - guaranteeing fair shares to everybody","author":"Brams Steven J.","year":"2000","unstructured":"Steven J. Brams and Alan D. Taylor . The win-win solution - guaranteeing fair shares to everybody . 2000 . Steven J. Brams and Alan D. Taylor. The win-win solution - guaranteeing fair shares to everybody. 2000."},{"key":"e_1_2_1_44_1","volume-title":"Algorithms for competitive division of chores. CoRR, abs\/1907.01766","author":"Br\u00e2nzei Simina","year":"2019","unstructured":"Simina Br\u00e2nzei and Fedor Sandomirskiy . Algorithms for competitive division of chores. CoRR, abs\/1907.01766 , 2019 . Simina Br\u00e2nzei and Fedor Sandomirskiy. Algorithms for competitive division of chores. CoRR, abs\/1907.01766, 2019."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399447"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_2_1_47_1","first-page":"522","volume-title":"WINE","volume":"13112","author":"Caragiannis Ioannis","year":"2021","unstructured":"Ioannis Caragiannis and Stavros Ioannidis . Computing envy-freeable allocations with limited subsidies . In WINE , volume 13112 , pages 522 -- 539 , 2021 . Ioannis Caragiannis and Stavros Ioannidis. Computing envy-freeable allocations with limited subsidies. In WINE, volume 13112, pages 522--539, 2021."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329574"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_2_1_50_1","first-page":"231","volume-title":"AAMAS","author":"Chakraborty Mithun","year":"2020","unstructured":"Mithun Chakraborty , Ayumi Igarashi , Warut Suksompong , and Yair Zick . Weighted envy-freeness in indivisible item allocation . In AAMAS , pages 231 -- 239 , 2020 . Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, and Yair Zick. Weighted envy-freeness in indivisible item allocation. In AAMAS, pages 231--239, 2020."},{"key":"e_1_2_1_51_1","volume-title":"Weighted fairness notions for indivisible items revisited. CoRR, abs\/2112.04166","author":"Chakraborty Mithun","year":"2021","unstructured":"Mithun Chakraborty , Erel Segal-Halevi , and Warut Suksompong . Weighted fairness notions for indivisible items revisited. CoRR, abs\/2112.04166 , 2021 . Mithun Chakraborty, Erel Segal-Halevi, and Warut Suksompong. Weighted fairness notions for indivisible items revisited. CoRR, abs\/2112.04166, 2021."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399511"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.85"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467605"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16665"},{"key":"e_1_2_1_56_1","series-title":"SIAM J. Comput","volume-title":"A little charity guarantees almost envy-freeness","author":"Chaudhury Bhaskar Ray","year":"2021","unstructured":"Bhaskar Ray Chaudhury , Telikepalli Kavitha , Kurt Mehlhorn , and Alkmini Sgouritsa . A little charity guarantees almost envy-freeness . SIAM J. Comput ., 2021 d. Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, and Alkmini Sgouritsa. A little charity guarantees almost envy-freeness. SIAM J. Comput., 2021d."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085125"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011853"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175469"},{"key":"e_1_2_1_60_1","volume-title":"How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1--17","author":"Dubins Lester E","year":"1961","unstructured":"Lester E Dubins and Edwin H Spanier . How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1--17 , 1961 . Lester E Dubins and Edwin H Spanier. How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1--17, 1961."},{"key":"e_1_2_1_61_1","volume-title":"How to fairly allocate easy and difficult chores. CoRR, abs\/2110.11285","author":"Ebadian Soroush","year":"2021","unstructured":"Soroush Ebadian , Dominik Peters , and Nisarg Shah . How to fairly allocate easy and difficult chores. CoRR, abs\/2110.11285 , 2021 . Soroush Ebadian, Dominik Peters, and Nisarg Shah. How to fairly allocate easy and difficult chores. CoRR, abs\/2110.11285, 2021."},{"key":"e_1_2_1_62_1","volume-title":"Rental harmony: Sperner's lemma in fair division. The American mathematical monthly, 106(10):930--942","author":"Su Francis Edward","year":"1999","unstructured":"Francis Edward Su . Rental harmony: Sperner's lemma in fair division. The American mathematical monthly, 106(10):930--942 , 1999 . Francis Edward Su. Rental harmony: Sperner's lemma in fair division. The American mathematical monthly, 106(10):930--942, 1999."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219174"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11291"},{"key":"e_1_2_1_65_1","first-page":"355","volume-title":"WINE","author":"Feige Uriel","year":"2021","unstructured":"Uriel Feige , Ariel Sapir , and Laliv Tauber . A tight negative example for MMS fair allocations . In WINE , pages 355 -- 372 , 2021 . Uriel Feige, Ariel Sapir, and Laliv Tauber. A tight negative example for MMS fair allocations. In WINE, pages 355--372, 2021."},{"key":"e_1_2_1_66_1","volume-title":"Resource allocation and the public sector","author":"Foley Duncan Karl","year":"1966","unstructured":"Duncan Karl Foley . Resource allocation and the public sector . Yale University , 1966 . Duncan Karl Foley. Resource allocation and the public sector. Yale University, 1966."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399537"},{"key":"e_1_2_1_68_1","volume-title":"Unified fair allocation of goods and chores via copies. CoRR, abs\/2109.08671","author":"Gafni Yotam","year":"2021","unstructured":"Yotam Gafni , Xin Huang , Ron Lavi , and Inbal Talgam-Cohen . Unified fair allocation of goods and chores via copies. CoRR, abs\/2109.08671 , 2021 . Yotam Gafni, Xin Huang, Ron Lavi, and Inbal Talgam-Cohen. Unified fair allocation of goods and chores via copies. CoRR, abs\/2109.08671, 2021."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85947-3_23"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103547"},{"key":"e_1_2_1_71_1","first-page":"1","volume-title":"SOSA","volume":"69","author":"Garg Jugal","year":"2019","unstructured":"Jugal Garg , Peter McGlaughlin , and Setareh Taki . Approximating maximin share allocations . In SOSA , volume 69 , pages 20: 1 -- 20 :11, 2019 . Jugal Garg, Peter McGlaughlin, and Setareh Taki. Approximating maximin share allocations. In SOSA, volume 69, pages 20:1--20:11, 2019."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85947-3_22"},{"key":"e_1_2_1_73_1","volume-title":"Fair and efficient allocations of chores under bivalued preferences. CoRR, abs\/2110.09601","author":"Garg Jugal","year":"2021","unstructured":"Jugal Garg , Aniket Murhekar , and John Qin . Fair and efficient allocations of chores under bivalued preferences. CoRR, abs\/2110.09601 , 2021 b. Jugal Garg, Aniket Murhekar, and John Qin. Fair and efficient allocations of chores under bivalued preferences. CoRR, abs\/2110.09601, 2021b."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30473-7_25"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/32"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176992173"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16689"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467555"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467553"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47904-9_8"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_2_1_84_1","first-page":"122","volume-title":"WWW","author":"Li Bo","year":"2022","unstructured":"Bo Li , Yingkai Li , and Xiaowei Wu. Almost (weighted) proportional allocations for indivisible chores . In WWW , pages 122 -- 131 . ACM, 2022 . Bo Li, Yingkai Li, and Xiaowei Wu. Almost (weighted) proportional allocations for indivisible chores. In WWW, pages 122--131. ACM, 2022."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-2727(90)90003-Z"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"e_1_2_1_88_1","volume-title":"Annu. Rev. Econ.","author":"Moulin Herv\u00e9","year":"2018","unstructured":"Herv\u00e9 Moulin . Fair division in the age of internet . Annu. Rev. Econ. , 2018 . Herv\u00e9 Moulin. Fair division in the age of internet. Annu. Rev. Econ., 2018."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352872"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1313349"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M124397X"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855"},{"key":"e_1_2_1_93_1","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus . The problem of fair division . Econometrica , 16 : 101 -- 104 , 1948 . Hugo Steinhaus. The problem of fair division. Econometrica, 16:101--104, 1948.","journal-title":"Econometrica"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2017.09.004"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3505156.3505162"},{"key":"e_1_2_1_96_1","first-page":"1281","volume-title":"AAMAS","author":"Sun Ankang","year":"2021","unstructured":"Ankang Sun , Bo Chen , and Xuan Vinh Doan . Connections between fairness criteria and efficiency for allocating indivisible chores . In AAMAS , pages 1281 -- 1289 , 2021 . Ankang Sun, Bo Chen, and Xuan Vinh Doan. Connections between fairness criteria and efficiency for allocating indivisible chores. In AAMAS, pages 1281--1289, 2021."},{"key":"e_1_2_1_97_1","volume-title":"Mathematiese psychologie. Mens en Maatschappij, 6(4):342--352","author":"Tinbergen Jan","year":"1930","unstructured":"Jan Tinbergen . Mathematiese psychologie. Mens en Maatschappij, 6(4):342--352 , 1930 . Jan Tinbergen. Mathematiese psychologie. Mens en Maatschappij, 6(4):342--352, 1930."},{"key":"e_1_2_1_98_1","volume-title":"envy, and efficiency","author":"Varian Hal R","year":"1973","unstructured":"Hal R Varian . Equity , envy, and efficiency . 1973 . Hal R Varian. Equity, envy, and efficiency. 1973."},{"key":"e_1_2_1_99_1","first-page":"4966","volume-title":"IJCAI","author":"Walsh Toby","year":"2020","unstructured":"Toby Walsh . Fair division : The computer scientist's perspective . In IJCAI , pages 4966 -- 4972 , 2020 . Toby Walsh. Fair division: The computer scientist's perspective. In IJCAI, pages 4966--4972, 2020."},{"key":"e_1_2_1_100_1","volume-title":"Approximately EFX allocations for indivisible chores. CoRR, abs\/2109.07313","author":"Zhou Shengwei","year":"2021","unstructured":"Shengwei Zhou and Xiaowei Wu . Approximately EFX allocations for indivisible chores. CoRR, abs\/2109.07313 , 2021 . Shengwei Zhou and Xiaowei Wu. Approximately EFX allocations for indivisible chores. CoRR, abs\/2109.07313, 2021."}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572885.3572887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572885.3572887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:38Z","timestamp":1750182698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572885.3572887"}},"subtitle":["a survey and new questions"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":100,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3572885.3572887"],"URL":"https:\/\/doi.org\/10.1145\/3572885.3572887","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-11-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}