Chore division

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In problems of fair division, a resource (prototypically a cake) is to be divided amongst a finite number of players; the resource is assumed to be desirable, and more is assumed to be better. Chore division is the "dual" problem of allocating an undesirable resource (the prototype is the allocation of household chores).[1]

Many allocation schemes from conventional fair division problems (such as I cut, you choose) give an equally acceptable result when applied to chore division; some (especially moving-knife procedures) may easily be modified to apply to chore division.

Chore division is also called the dirty work problem.[2]

References[edit]

  1. ^ Elisha Peterson and Francis Edward Su. Four-person envy-free chore division. Mathematics Magazine, April 2002.
  2. ^ Jack Robertson and William Webb (1998). Cake-Cutting Algorithms: Be Fair If You Can, AK Peters Ltd, . ISBN 1-56881-076-8

See also[edit]