Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

Understand

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.