Barbanel, J. B.; Brams, S. J. - C.V. Starr Center for Applied Economics, Department of … - 2001
The minimal number of parallel cuts required to divide a cake into n pieces is n-1. A new 3-person procedure, requiring 2 parallel cuts, is given that produces an envy- free division, whereby each person thinks he or she receives at least a tied- for- largest piece. An extension of this...