Average Envy-freeness for Indivisible Items-Reference-Cited by-同舟云学术

Average Envy-freeness for Indivisible Items

Published:2023-10-30 Issue: Volume: Page:
ISSN:
Container-title:Equity and Access in Algorithms, Mechanisms, and Optimization
language:
Short-container-title:

Author:

Han Qishen¹^ORCID,Tao Biaoshuai²^ORCID,Xia Lirong³^ORCID

Affiliation:

1. Rensselaer Polytechnic Institute, USA

2. Shanghai Jiao Tong University, China

3. Rensselaer Polytechnic Institute, United States

Funder

National Science Foundation

National Natural Science Foundation of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3617694.3623229

Reference30 articles.

1. Fair allocation of indivisible goods and chores

2. Fair assignment of indivisible objects under ordinal preferences

3. 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).

4. 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

5. A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation