We consider a fair division model in which agents have general valuations for bundles of indivisible items. We propose two new approximate properties for envy freeness of allocations in this model: DEFX and DEF1. We compare these with two existing axiomatic properties: EFX and EF1. For example, we give the first result confirming that EFX allocations may not exist with general but identical valuations. However, even when they do exist in such problems, we prove that DEFX (and, therefore DEF1) and PO allocations exist whereas EFX and PO allocations may not exist. Our results assert eloquently that DEFX and DEF1 approximate fairness better than EFX and EF1.
CITATION STYLE
Aleksandrov, M. (2022). Envy Freeness Up to One Item: Shall We Duplicate or Remove Resources? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13566 LNAI, pp. 727–738). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-16474-3_59
Mendeley helps you to discover research relevant for your work.