Chore division on a graph - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Autonomous Agents and Multi-Agent Systems Année : 2019

Chore division on a graph

Résumé

The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent’s share has to form a connected subgraph of this graph. Although a similar model has been investigated before for goods, we show that the goods and chores settings are inherently different. In particular, it is impossible to derive the solution of the chores instance from the solution of its naturally associated fair division instance. We consider three common fair division solution concepts, namely proportionality, envy-freeness and equitability, and two individual disutility aggregation functions: additive and maximum based. We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.
Fichier principal
Vignette du fichier
chore_division.pdf (176.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02303821 , version 1 (02-10-2019)

Identifiants

Citer

Sylvain Bouveret, Katarína Cechlarova, Julien Lesca. Chore division on a graph. Autonomous Agents and Multi-Agent Systems, 2019, 33 (5), ⟨10.1007/s10458-019-09415-z⟩. ⟨hal-02303821⟩
52 Consultations
185 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More