Chore division is a fair division problem in which the divided resource is undesirable, so that each participant wants to get as little as possible. It is the illustrating mirror-image of the fair cake-cutting problem, in which the divided resource is desirable so that each participant wants to get as much as possible.
Chore division is a fair division problem in which the divided resource is undesirable, so that each participant wants to get as little as possible. It is the illustrating mirror-image of the fair cake-cutting problem, in which the divided resource is desirable so that each participant wants to get as much as possible.
Source: Wikipedia "Chore division" · CC BY-SA 4.0
Share this article: X · Bluesky