# Lone-Divider Method – How to Fairly Divide a Pie

Saturday was the Pi Day of a lifetime – 3/14/15 9:26:53! Hopefully all of you were able to share some delicious pie with your friends and family. When slicing up your pie how can you make sure everyone received a fair share? It’s the Lone-Divider Method to the rescue!

The Lone-Divider Method for N players dividing a pie can be described by the following process:

Preliminaries – As the name suggests, one of the players is chosen to be the divider, D, while the other N-1 players act as choosers. It’s always better to be one of the choosers than to be the divider – the divider is guaranteed a piece worth exactly $\frac{1}{N}$ of the total value of the pie whereas the choosers have a chance to get a piece worth more than $\frac{1}{N}$ of the total value. Since we want this method to be fair to all players, everyone should have an equal chance of being the divider (which can be done randomly).

Step 1 (Division) – The divider, D, divides the pie into N pieces ( $s_{1}, s_{2}, \ldots, s_{N}$). The divider knows that he/she will receive one of these pieces, but at this point does not know which one. This is important because it forces D to divide the cake into N slices that to him/her have equal value.

Step 2 (Bidding) – Each of the N-1 choosers submits a bid that lists every piece he or she considers to be a fair share (i.e. worth $\frac{1}{N}$ or more of the total value of the pie). These bids are made secretly and independently of the other choosers.

Step 3 (Distribution) – The bid lists are opened. Depending on these lists, there are two different ways we may have to proceed.

Case 1 – If there is a way to assign a different slice of pie to each of the N-1 choosers, then that should be done. The divider (who equally prefers all of the pie slices)gets the last unassigned slice. At the end, the players may choose to swap pieces if they want.

Case 2 – There is a standoff! In this case, there are two choosers bidding for the same piece of pie (or K choosers bidding for fewer than K pieces). This case is complicated and we give a brief overview of how to proceed when a standoff occurs. First, we set aside any of the pieces of pie that were involved in the standoff. In addition, we temporarily separate any players involved in the standoff from the others. It is possible for multiple standoffs to occur and each standoff is handled individually. For ease of explanation, we assume only one standoff has occurred. Once the standoff players and pie slices are isolated, each of the remaining players (including the divisor) is assigned a fair share from the remaining pie pieces. All the remaining pie pieces (those involved in the standoff) are then recombined into a new “pie” S to be divided among the players involved in the standoff and the process starts all over again.

We will consider two examples to illustrate the two cases that can occur in the distribution step. Four friends, Abby, Jenny, Ellie, and Maddie, want to share a pie for pi day. Abby is randomly chosen as the divider and cuts the pie into four pieces ( $s_1, s_2, s_3,$ and $s_4$). The following table shows how each of the friends values the four pieces.

 s1 s2 s3 s4 Abby 25% 25% 25% 25% Jenny 40% 20% 20% 20% Ellie 25% 20% 40% 15% Maddie 20% 20% 30% 30%

In this example, Jenny’s bid list is { $s_{1}$} only, Ellie’s bid list is { $s_{1}, s_{3}$}, and Maddie’s bid list is { $s_{3}, s_{4}$}. It is clear that Jenny must get $s_{1}$ – there is no other option. This forces the rest of the distribution. Piece $s_{3}$ must then go to Ellie and piece $s_{4}$ goes to Maddie. Finally, the remaining piece of pie, $s_{2}$ goes to the divider, Abby.

In our next example, we see what happens when a standoff occurs. Again our four friends, Abby, Jenny, Ellie, and Maddie, want to share a pie for pi day, with Abby being named the divider. Abby cuts the pie into four pieces ( $s_1, s_2, s_3,$ and $s_4$). The following table shows how each of the friends values the four pieces.

 s1 s2 s3 s4 Abby 25% 25% 25% 25% Jenny 40% 20% 20% 20% Ellie 35% 20% 22% 23% Maddie 20% 20% 35% 25%

In this example, Jenny’s bid list is { $s_{1}$} only, Ellie’s bid list is { $s_{1}$} only, and Maddie’s bid list is { $s_{3}, s_{4}$}. It is clear that we have a standoff – both Jenny and Ellie want piece $s_{1}$! The first step of the distribution process is to set piece $s_{1}$ aside and assign Abby and Maddie a fair share from $s_{2}, s_{3},$ and $s_{4}$. Notice that Maddie could be given either piece $s_{3}$ or $s_{4}$. She would prefer to have $s_{3}$, but that’s not for her to decide at this point – a coin toss can be used to determine which piece Maddie receives. Let’s say Maddie ends up with $s_{3}$. Then Abby could be given either piece $s_{2}$ or $s_{4}$. Another coin toss determines that Abby receives piece $s_{2}$. Now we must determine what Jenny and Ellie receive. At this point, we recombine the remaining pie pieces ( $s_{1}$ and $s_{4}$) into a single piece to be divided between Jenny and Ellie using the divider-chooser method. Since $(s_{1} + s_{4})$ is worth 60% to Jenny and 58% to Ellie, regardless of how this final division plays out they are both guaranteed a final share worth more than 25% of the pie. When all is said and done, every player ends up with a fair share.

This method works equally well for cake and pizza (or any other continuously divisible items). So go out and enjoy, knowing you are now equipped with a method to fairly divide your pie, cake, and pizza! Happy Pi Day!

Sources:

Tannenbaum, Peter. Excursions in Modern Mathematics (Sixth Edition). Upper Saddle River, N.J: Pearson Prentice Hall, 2007. 