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...
Päätekijät: | Bouveret, S, Cechlárová, K, Elkind, E, Igarashi, A, Peters, D |
---|---|
Aineistotyyppi: | Conference item |
Julkaistu: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2017
|
Samankaltaisia teoksia
-
Fair division of the commons
Tekijä: Peters, D
Julkaistu: (2019) -
The price of connectivity in fair division
Tekijä: Bei, Xiaohui, et al.
Julkaistu: (2022) -
Hedonic games with graph-restricted communication
Tekijä: Igarashi, A, et al.
Julkaistu: (2016) -
Fair Division.
Tekijä: Young, H
Julkaistu: (1991) -
The Efficiency of Fair Division
Tekijä: Caragiannis, I, et al.
Julkaistu: (2012)