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...
Main Authors: | 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, et al.
出版: (2022) -
Hedonic games with graph-restricted communication
由: Igarashi, A, et al.
出版: (2016) -
Fair Division.
由: Young, H
出版: (1991) -
The Efficiency of Fair Division
由: Caragiannis, I, et al.
出版: (2012)