2016: Aziz and Mackenzie found a solution of the envy-free cake-cutting problem for n people in a bounded number of steps.
2015: Aziz and Mackenzie found a solution of the envy-free cake-cutting problem for 4 people in a bounded number of steps.
1995: Brams and Taylor found a solution of the envy-free cake-cutting problem for n people in an unbounded number of steps.
To the MNS presentation