Mathwords logoMathwords

Last-Diminisher Method — Definition, Formula & Example

The last-diminisher method is a fair-division procedure in which one player cuts a piece they consider a fair share. Each other player may trim it smaller, and the last person to trim it keeps it. The process repeats until everyone has a piece.

Suppose NN players divide a divisible set SS, and each player ii has a nonnegative, additive valuation ViV_i. In a round with n≥3n \ge 3 players and remaining set RR, the cutter cuts a piece C⊆RC \subseteq R with Vcutter(C)=1nVcutter(R)V_{\text{cutter}}(C) = \frac{1}{n}V_{\text{cutter}}(R). Each other player jj then acts in turn. If Vj(C)>1nVj(R)V_j(C) > \frac{1}{n}V_j(R), player jj trims CC so that Vj(C)=1nVj(R)V_j(C) = \frac{1}{n}V_j(R), and the trimmings return to RR. Otherwise, player jj passes. The last player to trim, or the cutter if nobody trims, receives CC and leaves. The remaining n−1n-1 players repeat the process on what is left, and the final two players finish with divide-and-choose. Every player who follows this strategy receives a piece PiP_i with Vi(Pi)≥1NVi(S)V_i(P_i) \ge \frac{1}{N}V_i(S), so the division is proportional. Stefan Banach and Bronisław Knaster devised the method, and Hugo Steinhaus published it in 1948.

Key Formula

Vi(Pi)≥1N Vi(S)V_i(P_i) \ge \frac{1}{N}\,V_i(S)
Where:
  • ViV_i = Player i's personal valuation of a piece
  • PiP_i = The piece player i finally receives
  • SS = The whole item being divided
  • NN = The number of players

Worked Example

Problem: Ana, Ben, and Cal split a 12-inch sandwich, measured from 0 to 12 inches. Ana values every inch at $1, for a total of $12. Ben values each inch from 0 to 6 at $2 and each inch from 6 to 12 at $1, for a total of $18. Cal values every inch at $1.50, for a total of $18. Ana cuts first, then Ben, then Cal. Use the last-diminisher method.
Step 1: Ana's fair share is one-third of $12. She cuts the piece from 0 to 4 inches, which is worth exactly $4 to her.
13(12)=4\tfrac{1}{3}(12) = 4
Step 2: Ben's fair share is $6. He values the 0–4 inch piece at $8, which is more than $6, so he trims it to the 0–3 inch piece, worth exactly $6 to him. Cal values 0–3 at only $4.50, which is less than his $6 share, so he passes. Ben is the last diminisher, and he takes 0–3.
2(4)=8>6,2(3)=6,1.5(3)=4.5<62(4) = 8 > 6, \quad 2(3) = 6, \quad 1.5(3) = 4.5 < 6
Step 3: Ana and Cal split the remaining 3–12 inch section with divide-and-choose. Ana values it at $9, so she cuts at 7.5 inches, making two halves worth $4.50 each to her. Cal values each half at $6.75. He picks 3–7.5, and Ana gets 7.5–12.
92=4.5,1.5(4.5)=6.75\tfrac{9}{2} = 4.5, \quad 1.5(4.5) = 6.75
Answer: Ben gets 0–3 inches (worth $6 to him, his fair share of $6). Cal gets 3–7.5 inches (worth $6.75 to him, at least his $6 share). Ana gets 7.5–12 inches (worth $4.50 to her, at least her $4 share). Every player receives at least one-third of the sandwich by their own measure.

Why It Matters

The last-diminisher method is commonly taught in the fair-division unit of liberal-arts math courses and appears in some discrete math courses. It is also an early algorithm that works for any number of players. Proving its proportionality guarantee is a standard exercise in mathematical induction, and the same ideas apply to dividing estates, land, or shared resources.

Common Mistakes

Mistake: Assuming the method is envy-free because every player gets a fair share.
Correction: The method guarantees proportionality only. In the example, Ben values Cal's piece (3–7.5 inches) at $7.50, which is more than his own $6. A player can get a fair share and still prefer someone else's piece.

Related Terms