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.
Type de document :
Communication dans un congrès
26th International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. 2017, 〈http://ijcai-17.org/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01609255
Contributeur : Sylvain Bouveret <>
Soumis le : mardi 3 octobre 2017 - 14:03:59
Dernière modification le : jeudi 11 janvier 2018 - 06:22:07

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

35