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)