Backward Induction
Updated 2026-08-11
INTRODUCTION
English translation pending.
CORE DEFINITION
Backward induction solves a sequential game or decision by starting at the terminal nodes: it determines what each player would do at the final move, substitutes that behavior into the preceding decision, and repeats back to the start. The result is a strategy in which every early move is optimal given that all later players will also be optimal, which is the subgame-perfect equilibrium and a sharper solution than one that assumes rational play only at the start.
SCAFFOLDING EFFECT
Reduce cognitive load
- Draw the endgame: write the tree and its terminal payoffs. - Solve the last move: determine optimal play at each terminal decision. - Fold backward: substitute the answer into the preceding choice.
Anchor fast decisions
A move early in the game is only rational relative to what will happen later, and later behavior is determined first because it faces no further dependency. Solving from the end backward makes each earlier choice conditional on the actual continuation rather than on a guess about it, which is what makes the equilibrium subgame-perfect rather than merely stable.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Backward_inductionverified
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