Thumbnail

Local Envy-Freeness in House Allocation Problems

Beynier, Aurélie; Chevaleyre, Yann; Gourvès, Laurent; Lesca, Julien; Maudet, Nicolas; Wilczynski, Anaëlle (2018), Local Envy-Freeness in House Allocation Problems, in Dastani, Mehdi; Sukthankar, Gita; André, Elisabeth; Koenig, Sven, 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'18), IFAAMAS, p. 292-300

View/Open
Type
Communication / Conférence
Date
2018
Conference title
17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'18)
Conference date
2018-07
Conference city
Stockholm
Conference country
Sweden
Book title
17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'18)
Book author
Dastani, Mehdi; Sukthankar, Gita; André, Elisabeth; Koenig, Sven
Publisher
IFAAMAS
Pages
292-300
Metadata
Show full item record
Author(s)
Beynier, Aurélie
Laboratoire d'Informatique de Paris 6 [LIP6]
Chevaleyre, Yann
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Lesca, Julien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Maudet, Nicolas cc
Laboratoire d'Informatique de Paris 6 [LIP6]
Wilczynski, Anaëlle cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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 social 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.
Subjects / Keywords
Object allocation; Envy-Freeness; Complexity; Algorithms