arXiv · 2508.09290
Swap Bounded Envy
Abstract
We study fairness in the allocation of discrete goods. Exactly fair (envy-free) allocations are impossible, so we discuss notions of approximate fairness. In particular, we focus on allocations in which the swap of two items serves to eliminate any envy, either for the allocated bundles or with respect to a reference bundle. We propose an algorithm that, under some restrictions on agents' preferences, achieves an allocation with ``swap bounded envy.''
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Federico Echenique, Sumit Goel, SangMok Lee. 2025-08-12. Swap Bounded Envy. https://arxiv.org/abs/2508.09290
Cite the original work for its findings. Save a collection to share your selection of sources.