Swap Bounded Envy

Federico Echenique, Sumit Goel and SangMok Lee

Papers from arXiv.org

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

Date: 2025-08
New Economics Papers: this item is included in nep-des and nep-mic
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2508.09290 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2508.09290

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().