Cut and Choose
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
How to divide a cake fairly between two people? The oldest and most effective algorithm is: "One cuts, the other chooses first." The person cutting the cake, to prevent getting the smaller piece (regardless of which piece the other chooses), will inevitably cut it extremely evenly. - Scaffolding role: A meta-algorithm for checks and balances. - This is the ultimate model for resolving conflicts of interest. In institutional design, "the rule-maker" cannot be "the rule-enforcer," or "the price-setter" cannot be "the priority buyer." As long as those who exercise power bear the risk (the pain of the knife), fairness will emerge automatically.
SCAFFOLDING EFFECT
Reduce cognitive load
A meta-algorithm for checks and balances. - This is the ultimate model for resolving conflicts of interest. In institutional design, "the rule-maker" cannot be "the rule-enforcer," or "the price-setter" cannot be "the priority buyer." As long as those who exercise power bear the risk (the pain of the knife), fairness will emerge automatically.
Anchor fast decisions
A game-theoretic fair division protocol. The divider chooses last, making their self-interest force equal division—if unequal, they will get the smaller piece. The mechanism is "risk internalization": the divider bears the consequences of inequality, and fairness emerges automatically (same principle as the porridge distribution system).
MINIMUM ACTION
In progress 0/4Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Divide_and_chooseverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS