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