|Is there a perfect way to cut a cake? I explore.|
Image courtesy jeremyfoo, Flickr via CC license.
We all know how to cut a cake, right? Even Wilton gives diagrams on how to cut a cake in every conceivable shape there is, including the most common round shape (below).
|Cake Cutting Diagram for Round Cakes - via Wilton.|
Cutting a Cake to Prevent Dry Surfaces
First, we look to Sir Francis Galton. A few years before he was knighted he had his humorous answer for the dilemma of cutting a cake in a way "so as to leave a minimum of exposed surface to become dry" in Nature, 1906. He wanted the best way to take a small cake for two and have it 'fresh' for 3 days, meaning no dry exposed areas. Each day, a third of the cake was removed and served to two people. I posted Galton's Cutting a Round Cake on Scientific Principles on Old School Pastry for you to read.
Today, we use plastic wrap. Galton' answer in 1906:
- Take a cake 5 inches across, and make two cuts down the middle to remove the center slice. Cut that center slice in half, and serve two people. Press the remaining halves together, secure with a rubber band (I'm assuming he only consumed fondant-covered or stiff royal icing-coverd cakes? Rubber bands don't work too well with buttercream.).
- Next day, make two cuts to remove the center piece again, and serve two people. Push the remainder halves together, securing like the day before.
- Final day, you are left with 4 small pieces. Divide in half and serve the same two people two portions each, and there you have 3 servings of cake for 2 people, each having a slice that has no dry edges.
Cutting a Cake so Everyone Gets a "Perfect" Slice
Steven J. Brams, Michael A. Jones, and Christian Klamer from the American Mathematical Society, together published Better Ways to Cut a Cake in the December 2006 issue of Notices, Volume 53, Issue 11. It is described as:
- A mathematical cake, as viewed by n persons participating in its division, is modeled by their n (covert) value functions on the unit interval. Each participant can cut the cake at a point by a vertical line at that point, and each is assumed to make their cut so as to maximize the value of the minimum size piece they might receive. The authors explore algorithms that allow this division to be fair to all.
Their research led them to search the answer to satisfy these three key features.
- The first is envy-freeness - where every person thinks they are getting the best piece so they don't envy the next person's slice.
- The second is efficiency - where there is no other cut that is better.
- And the last is equability - where every person thinks that each cut is the same as, or just as good as, the next person's.
Below: Galton's Example via Numberphile.