A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
[article]
2020
arXiv
pre-print
We study the chore division problem where a set of agents needs to divide a set of chores (bads) among themselves fairly and efficiently. We assume that agents have linear disutility (cost) functions. Like for the case of goods, competitive division is known to be arguably the best mechanism for the bads as well. However, unlike goods, there are multiple competitive divisions with very different disutility value profiles in bads. Although all competitive divisions satisfy the standard notions
arXiv:2008.00285v1
fatcat:zy6djyt7vvez7gldoy27fzx7wi