{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:08:57Z","timestamp":1750219737128,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2007994,2106983,2303000"],"award-info":[{"award-number":["2007994,2106983,2303000"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102252"],"award-info":[{"award-number":["62102252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,30]]},"DOI":"10.1145\/3617694.3623229","type":"proceedings-article","created":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T15:52:11Z","timestamp":1698594731000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Average Envy-freeness for Indivisible Items"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0268-6918","authenticated-orcid":false,"given":"Qishen","family":"Han","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4098-844X","authenticated-orcid":false,"given":"Biaoshuai","family":"Tao","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9800-6691","authenticated-orcid":false,"given":"Lirong","family":"Xia","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, United States"}]}],"member":"320","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-021-09532-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.06.002"},{"key":"e_1_3_2_1_3_1","volume-title":"The constrained round robin algorithm for fair and efficient allocation. arXiv preprint arXiv:1908.00161","author":"Aziz Haris","year":"2019","unstructured":"Haris Aziz , Xin Huang , Nicholas Mattei , and Erel Segal-Halevi . 2019. The constrained round robin algorithm for fair and efficient allocation. arXiv preprint arXiv:1908.00161 ( 2019 ). Haris Aziz, Xin Huang, Nicholas Mattei, and Erel Segal-Halevi. 2019. The constrained round robin algorithm for fair and efficient allocation. arXiv preprint arXiv:1908.00161 (2019)."},{"key":"e_1_3_2_1_4_1","volume-title":"Computing welfare-Maximizing fair allocations of indivisible goods. European Journal of Operational Research","author":"Aziz Haris","year":"2022","unstructured":"Haris Aziz , Xin Huang , Nicholas Mattei , and Erel Segal-Halevi . 2022. Computing welfare-Maximizing fair allocations of indivisible goods. European Journal of Operational Research ( 2022 ). https:\/\/doi.org\/10.1016\/j.ejor.2022.10.013 10.1016\/j.ejor.2022.10.013 Haris Aziz, Xin Huang, Nicholas Mattei, and Erel Segal-Halevi. 2022. Computing welfare-Maximizing fair allocations of indivisible goods. European Journal of Operational Research (2022). https:\/\/doi.org\/10.1016\/j.ejor.2022.10.013"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.07.005"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467559"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287582"},{"key":"e_1_3_2_1_8_1","unstructured":"Gerdus Benad\u00e8 Daniel Halpern Alexandros Psomas and Paritosh Verma. 2023. On the Existence of Envy-Free Allocations Beyond Additive Valuations. arxiv:2307.09648\u00a0[cs.GT]  Gerdus Benad\u00e8 Daniel Halpern Alexandros Psomas and Paritosh Verma. 2023. On the Existence of Envy-Free Allocations Beyond Additive Valuations. arxiv:2307.09648\u00a0[cs.GT]"},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0207)","author":"Bhaskar Umang","year":"2021","unstructured":"Umang Bhaskar , A.\u00a0 R. Sricharan , and Rohit Vaish . 2021 . On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques (APPROX\/RANDOM 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0207) , Mary Wootters and Laura Sanit\u00e0 (Eds.). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 1:1\u20131:23. Umang Bhaskar, A.\u00a0R. Sricharan, and Rohit Vaish. 2021. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2021)(Leibniz International Proceedings in Informatics (LIPIcs), Vol.\u00a0207), Mary Wootters and Laura Sanit\u00e0 (Eds.). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 1:1\u20131:23."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304430"},{"key":"#cr-split#-e_1_3_2_1_11_1.1","doi-asserted-by":"crossref","unstructured":"Arpita Biswas and Siddharth Barman. 2019. Matroid Constrained Fair Allocation Problem. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence (Honolulu Hawaii USA). AAAI Press Article 1259 2\u00a0pages. https:\/\/doi.org\/10.1609\/aaai.v33i01.33019921 10.1609\/aaai.v33i01.33019921","DOI":"10.1609\/aaai.v33i01.33019921"},{"key":"#cr-split#-e_1_3_2_1_11_1.2","doi-asserted-by":"crossref","unstructured":"Arpita Biswas and Siddharth Barman. 2019. Matroid Constrained Fair Allocation Problem. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence (Honolulu Hawaii USA). AAAI Press Article 1259 2\u00a0pages. https:\/\/doi.org\/10.1609\/aaai.v33i01.33019921","DOI":"10.1609\/aaai.v33i01.33019921"},{"key":"e_1_3_2_1_12_1","volume-title":"On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. arXiv preprint arXiv:2205.14296","author":"Bu Xiaolin","year":"2022","unstructured":"Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , and Biaoshuai Tao . 2022. On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. arXiv preprint arXiv:2205.14296 ( 2022 ). Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, and Biaoshuai Tao. 2022. On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. arXiv preprint arXiv:2205.14296 (2022)."},{"key":"e_1_3_2_1_13_1","unstructured":"Krist\u00f3f B\u00e9rczi Erika\u00a0R. B\u00e9rczi-Kov\u00e1cs Endre Boros Fekadu\u00a0Tolessa Gedefa Naoyuki Kamiyama Telikepalli Kavitha Yusuke Kobayashi and Kazuhisa Makino. 2020. Envy-free Relaxations for Goods Chores and Mixed Items. arxiv:2006.04428\u00a0[econ.TH]  Krist\u00f3f B\u00e9rczi Erika\u00a0R. B\u00e9rczi-Kov\u00e1cs Endre Boros Fekadu\u00a0Tolessa Gedefa Naoyuki Kamiyama Telikepalli Kavitha Yusuke Kobayashi and Kazuhisa Makino. 2020. Envy-free Relaxations for Goods Chores and Mixed Items. arxiv:2006.04428\u00a0[econ.TH]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457166"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103578"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20425"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16670"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11291"},{"key":"e_1_3_2_1_19_1","volume-title":"Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446","author":"Gan Jiarui","year":"2021","unstructured":"Jiarui Gan , Bo Li , and Xiaowei Wu. 2021. Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446 ( 2021 ). Jiarui Gan, Bo Li, and Xiaowei Wu. 2021. Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446 (2021)."},{"volume-title":"Computers and Intractability","author":"Garey Michael","key":"e_1_3_2_1_20_1","unstructured":"Michael Garey and David Johnson . 1979. Computers and Intractability . W. H. Freeman and Company . Michael Garey and David Johnson. 1979. Computers and Intractability. W. H. Freeman and Company."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103633"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5573"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512057"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/63"},{"key":"e_1_3_2_1_26_1","volume-title":"How can we decide a fair allocation of healthcare resources during a pandemic?Journal of Medical Ethics 47, 12","author":"Roadevin Cristina","year":"2021","unstructured":"Cristina Roadevin and Harry Hill . 2021. How can we decide a fair allocation of healthcare resources during a pandemic?Journal of Medical Ethics 47, 12 ( 2021 ), e84\u2013e84. Cristina Roadevin and Harry Hill. 2021. How can we decide a fair allocation of healthcare resources during a pandemic?Journal of Medical Ethics 47, 12 (2021), e84\u2013e84."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2022.03.004"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2362139"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597763"}],"event":{"name":"EAAMO '23: Equity and Access in Algorithms, Mechanisms, and Optimization","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGecom Special Interest Group on Economics and Computation"],"location":"Boston MA USA","acronym":"EAAMO '23"},"container-title":["Equity and Access in Algorithms, Mechanisms, and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617694.3623229","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3617694.3623229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:32Z","timestamp":1750178192000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617694.3623229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":30,"alternative-id":["10.1145\/3617694.3623229","10.1145\/3617694"],"URL":"https:\/\/doi.org\/10.1145\/3617694.3623229","relation":{},"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"2023-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}