Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei

TL;DR
This paper advances the understanding of envy-free allocations for indivisible goods by establishing new existence results and algorithms for specific valuation classes, including restricted additive and bounded valuations.
Contribution
It introduces novel algorithms and theoretical results for EFX allocations under various valuation restrictions, expanding the scope of fair division solutions.
Findings
Existence of EF2X allocations for (∞,1)-bounded valuations.
EFX allocations with limited discarded goods for certain valuation classes.
New concepts like virtual value and rankpath improve understanding of EFX allocations.
Abstract
The existence of allocations stands as one of the main challenges in discrete fair division.In this paper, we present symmetrical results on the existence of and its approximate variations for two distinct valuations: restricted additive valuations and -bounded valuations introduced by Christodoulou \etal \cite{christodoulou2023fair}. In a -bounded instance, each good has relevance for at most agents, and any pair of agents shares at most common relevant goods. We show that instances with -bounded valuations admit allocations and allocations with at most discarded goods, mirroring results for the restricted additive setting \cite{akrami2022ef2x}. We also present algorithms for both restricted additive and -bounded…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinancial Reporting and Valuation Research · Law, Economics, and Judicial Systems
