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