Abstract
The minimal number of parallel cuts required to divide a cake into n pieces is n−1. A new 3-person procedure, requiring two 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 procedure leads to a 4-person division, using three parallel cuts, which makes at most one person envious. Finally, a 4-person envy-free procedure is given, but it requires up to five parallel cuts, and some pieces may be disconnected. All these procedures improve on extant procedures by using fewer moving knives, making fewer people envious, or using fewer cuts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
