Abstract
In this paper we consider the fair division of chores (tasks that need to be performed by agents, with negative utility for them), and study the loss in social welfare due to fairness. Previous work has been done on this so-called price of fairness, concerning fair division of cakes and chores with non-connected pieces and of cakes with connected pieces. We provide tight or nearly tight bounds on the price of fairness in situations where each player has to receive one connected piece of the chores. We also give the first proof of the existence of equitable divisions for chores with connected pieces. © Springer-Verlag 2013.
Cite
CITATION STYLE
Heydrich, S., & Van Stee, R. (2013). Dividing connected chores fairly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8146 LNCS, pp. 171–182). https://doi.org/10.1007/978-3-642-41392-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
