Local Envy-Freeness in House Allocation Problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Autonomous Agents and Multi-Agent Systems Année : 2019

Local Envy-Freeness in House Allocation Problems

Résumé

We study the fair division problem consisting in allocating one item per agent so as to avoid (or minimize) envy, in a setting where only agents connected in a given network may experience envy. In a variant of the problem, agents themselves can be located on the network by the central authority. These problems turn out to be difficult even on very simple graph structures, but we identify several tractable cases. We further provide practical algorithms and experimental insights.
Fichier principal
Vignette du fichier
manuscript.pdf (475.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02156844 , version 1 (14-06-2019)

Identifiants

Citer

Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, et al.. Local Envy-Freeness in House Allocation Problems. Autonomous Agents and Multi-Agent Systems, 2019, 33 (5), pp.591-627. ⟨10.1007/s10458-019-09417-x⟩. ⟨hal-02156844⟩
161 Consultations
310 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More