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...
Główni autorzy: | Bouveret, S, Cechlárová, K, Elkind, E, Igarashi, A, Peters, D |
---|---|
Format: | Conference item |
Wydane: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2017
|
Podobne zapisy
-
Fair division of the commons
od: Peters, D
Wydane: (2019) -
The price of connectivity in fair division
od: Bei, Xiaohui, i wsp.
Wydane: (2022) -
Hedonic games with graph-restricted communication
od: Igarashi, A, i wsp.
Wydane: (2016) -
Fair Division.
od: Young, H
Wydane: (1991) -
The Efficiency of Fair Division
od: Caragiannis, I, i wsp.
Wydane: (2012)