In proportional cake-cutting, there are $n$ agents with equal entitlements to a "cake" (an interval). Each agent $i$ has a nonatomic value measure $V_i$ over the cake, and it is required to create a ...
Stromquist and Woodall (1985) study the problem of Sets on which several measures agree. There are $n$ non-atomic value measures on the unit circle, and a parameter $w\in(0,1)$. The goal is to find a ...
The cake-cutting game is usually played between individuals. What if we try to play it between groups? A certain land has to be divided between two states. There are $n$ citizens in each state. ...
(copied from math.SE) BACKGROUND: A cake has to be divided among 3 people with possibly different tastes, such that each person receives a single connected piece, and no person prefers another person'...
I need to divide 48 pieces of jewelry between 3 inheritors so as to give equal, or nearly equal value, to each. I have learned that this is called the 3-partition problem. I solved it for 9 pieces of ...
Suppose that a parent brings home from a trip $2n$ gifts of roughly equal value for his/her two children. The children get to choose one at a time which gifts they want. What is the fairest way to do ...
Is there an algorithm in literature to compute an efficient (pareto optimal) and envy-free cake cutting when there are only $n=2$ players and a mediator?