We study the proportional chore division problem where a protocol wants to divide a negatively valued object, called chore, among n different players. The goal is to find an allocation such that cost of the chore assigned to each player be at most 1/n of the total cost. This problem is the dual variant of the cake cutting problem in which we want to allocate a desirable object. Edmonds and Pruh...