Paper Info
Title
Local envy-freeness in house allocation problems.
Abstract
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.
Year
DOI
Venue
2019
10.1007/s10458-019-09417-x
Autonomous Agents and Multi-Agent Systems
Keywords
DocType
Volume
Object allocation, Envy-freeness, Complexity, Algorithms
Journal
33
Issue
ISSN
Citations 
5
1387-2532
0
PageRank 
References 
Authors
0.34
0
7
Name
Order
Citations
PageRank
Aurélie Beynier1729.60
Yann Chevaleyre200.68
Laurent Gourvès324130.97
Ararat Harutyunyan45213.08
Julien Lesca5468.51
Nicolas Maudet6334.46
Anaëlle Wilczynski713.07