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)