arXiv Open Access 2025

Swap Bounded Envy

Federico Echenique Sumit Goel SangMok Lee

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

econ.TH cs.GT

Penulis (3)

Federico Echenique

Sumit Goel

SangMok Lee

Format Sitasi

APA MLA BibTeX

Echenique, F., Goel, S., Lee, S. (2025). Swap Bounded Envy. https://arxiv.org/abs/2508.09290

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓