N-person envy-free chore division

Details N-person envy-free chore division N-person envy-free chore division

2009-09-02

arxiv.org/abs/0909.0303v1

Mathematics

Combinatorics

7 pages, 1 figure. See related work at http://www.math.hmc.edu/~su/papers.html

Scientific paper

In contrast to the classical cake-cutting problem (how to fairly divide a desirable object), "chore division" is the problem of how to divide an undesirable object. We develop the first explicit algorithm for envy-free chore division among N people, a counterpart to the N-person envy-free cake-division solution of Brams-Taylor (1995). This is accomplished by exploiting a notion of "irrevocable advantage" for chores. We discuss the differences between cake-cutting and chore division and additional problems encountered in chore division.

Affiliated with

Also associated with

No associations

Rating

N-person envy-free chore division does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with N-person envy-free chore division, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and N-person envy-free chore division will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11696