Chore division on a graph

12/05/2018
by   Sylvain Bouveret, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2023

Fair Division of a Graph into Compact Bundles

We study the computational complexity of fair division of indivisible it...
research
12/22/2018

The Fair Division of Hereditary Set Systems

We consider the fair division of indivisible items using the maximin sha...
research
06/07/2022

Comparative study in fair division algorithms

A comparison of four fair division algorithms performed on real data fro...
research
08/15/2019

Connected Fair Allocation of Indivisible Goods

We study the fair allocation of indivisible goods under the assumption t...
research
04/12/2020

Closing Gaps in Asymptotic Fair Division

We study a resource allocation setting where m discrete items are to be ...
research
09/17/2021

Unified Fair Allocation of Goods and Chores via Copies

We consider fair allocation of indivisible items in a model with goods, ...
research
07/01/2020

Fair Division: The Computer Scientist’s Perspective

I survey recent progress on a classic and challenging problem in social ...

Please sign up or login with your details

Forgot password? Click here to reset