Fair Division of a Graph

Abstract : 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 the graph describes the accessibility relation among the plots. We focus on agents that have additive utilities for the items, and consider several common fair division solution concepts, such as proportionality, envy-freeness and maximin share guarantee. While finding good allocations according to these solution concepts is computationally hard in general, we design efficient algorithms for special cases wherethe underlying graph has simple structure, and/or the number of agents---or, less restrictively, the number of agent types---is small. In particular, despite non-existence results in the general case, we prove that for acyclic graphs a maximin share allocation always exists and can be found efficiently.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01609255
Contributor : Sylvain Bouveret <>
Submitted on : Tuesday, October 3, 2017 - 2:03:59 PM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM

Identifiers

  • HAL Id : hal-01609255, version 1

Collections

Citation

Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters. Fair Division of a Graph. 26th International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. 2017, 〈http://ijcai-17.org/〉. 〈hal-01609255〉

Share

Metrics

Record views

60