Fair division of a graph
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework captures, e.g., fair allocation of land plots, where t...
Hlavní autoři: | Bouveret, S, Cechlárová, K, Elkind, E, Igarashi, A, Peters, D |
---|---|
Médium: | Conference item |
Vydáno: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2017
|
Podobné jednotky
-
Fair division of the commons
Autor: Peters, D
Vydáno: (2019) -
The price of connectivity in fair division
Autor: Bei, Xiaohui, a další
Vydáno: (2022) -
Hedonic games with graph-restricted communication
Autor: Igarashi, A, a další
Vydáno: (2016) -
Fair Division.
Autor: Young, H
Vydáno: (1991) -
The Efficiency of Fair Division
Autor: Caragiannis, I, a další
Vydáno: (2012)