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...
Главные авторы: | Bouveret, S, Cechlárová, K, Elkind, E, Igarashi, A, Peters, D |
---|---|
Формат: | Conference item |
Опубликовано: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2017
|
Схожие документы
-
Fair division of the commons
по: Peters, D
Опубликовано: (2019) -
The price of connectivity in fair division
по: Bei, Xiaohui, и др.
Опубликовано: (2022) -
Hedonic games with graph-restricted communication
по: Igarashi, A, и др.
Опубликовано: (2016) -
Fair Division.
по: Young, H
Опубликовано: (1991) -
The Efficiency of Fair Division
по: Caragiannis, I, и др.
Опубликовано: (2012)