Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.5555/3237383.3237431 | PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18) |
Keywords | Field | DocType |
Object allocation, Envy-Freeness, Complexity, Algorithms | Graph,Social network,Fair division,Central authority,Computer science,Theoretical computer science,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aurélie Beynier | 1 | 72 | 9.60 |
| Yann Chevaleyre | 2 | 848 | 61.76 |
| Laurent Gourvès | 3 | 241 | 30.97 |
| Julien Lesca | 4 | 46 | 8.51 |
| Nicolas Maudet | 5 | 929 | 69.58 |
| Anaëlle Wilczynski | 6 | 1 | 3.07 |