Backward Induction

Why it matters

To choose your first move, start from the last one and reason backward — the future you’re walking toward is what decides the step you take now.

For example: you have to catch a 6:00 p.m. flight. You don’t reason forward from “when should I leave?” — you start at the gate and walk the clock back. Boarding closes 5:30, so security by 5:00, so the road by 4:15, so out the door at 4:00. Every step is fixed by the one after it, and only after fixing them all do you know what to do first: leave at 4:00.

What it reveals. What you should do now, in a situation that unfolds in stages — by solving the last stage first and letting its answer dictate the stage before it, all the way back to the present.
How it changes the read. You stop asking “what’s my best next move?” and start asking “what will a rational player do at the end, and what does that force me to do here?” The first move is the last thing you solve, not the first.
When to foreground it. Any sequential situation with a known endpoint where each choice closes off later options — multi-round negotiations, entry-and-response, deadline planning, anything where a move’s value depends on what it provokes several steps later.
What you’d miss without it. That a future-stage threat can be a bluff. “I’ll start a price war if you enter” only binds you if starting the war would still be rational once you’ve already entered — and folding the game back is the only way to tell.
Where it misleads. Its cold logic assumes everyone reasons all the way to the end and trusts everyone else to do the same. Real people often don’t — so the move it predicts can be exactly the move they won’t make.

How to invoke it in Ora

You’re looking at a situation that plays out in stages toward a known end — a negotiation across rounds, an entry-and-response, a plan against a hard deadline — and the right opening move isn’t obvious because its value depends on what happens much later.

Describe the stages, who moves when, and what each one is after, and ask:

“Game theory: solve this entry-deterrence game by backward induction. A challenger moves first (enter or stay out), then the incumbent responds (price war or accommodate). Reason from the end of the game tree back: is the incumbent’s threat to start a price war credible?”

Ora lays out the stages, solves the last one first, folds each stage’s answer back into the one before it, and tells you what the opening move should be — and whether the threats along the way actually hold up once you reason them through.

One thing to know: the phrase game theory routes you here — but framing matters as much as the signal word. Ask it as one party’s decision — “should the rival enter the market?” — and Ora reads it as a choice under uncertainty and sends you to a decision-making analysis instead, missing the strategic game. Frame it as a game to be solved — “solve this entry game by backward induction” — and you land in the right place. Game theory, backward induction, subgame perfect, or game tree are the words that point it the right way.

Describe the order of play and what each party actually values at the end, not just their stated positions — Ora infers the payoffs from what you give it and reasons back from the final stage. You don’t need a decision tree drawn out, though if you have the terminal payoffs (enter + war = −10 vs. +40; enter + accommodate = +50 each; stay out = 0 vs. +100), hand them over and the fold-back gets sharper.

One thing Ora won’t do: assume the other side will play the cold-logic move just because it’s rational. Where real players plausibly depart from the backward-induction prediction — and they often do — it says so, instead of quietly betting they won’t.

How it works

You have a flight at 6:00 p.m. and you need to be at the gate. So you do something you’ve done a hundred times without naming it: you think about your day in reverse.

Boarding closes at 5:30, so you have to be through security by 5:00. Security can take half an hour, so you have to be at the airport by 4:30. The drive is fifteen minutes and parking is another fifteen, so you have to pull out of the driveway by 4:00. Only now — having started at the very end and walked the clock backward — do you know the one thing you actually needed: leave at 4:00.

Notice what you did not do. You didn’t start from “it’s 2:30 now, what should I do first?” and try to plan forward. Forward, the day is a thicket of branches — run an errand or not, gas up or not, and each fork changes everything downstream. Backward, the thicket collapses. Each step has exactly one job: get you to the step after it on time. The last step has no step after it, so it’s easy to pin down — and once it’s pinned, the one before it is forced, and the one before that, until the whole chain falls into place and the first move drops out at the end.

That is backward induction. To solve a problem that unfolds in stages, you start at the final stage — where there’s no future left to complicate the choice, so the right move is plain — and you fold its answer back into the stage before it. Now that stage is a simple choice too, because you already know what comes next. You keep folding backward, stage by stage, until you reach the present, and the move waiting for you there is the move to make. The first decision is the last one you solve.

It is how you crack any sequence where a move’s worth depends on what it sets up. And it’s the test that calls a bluff. Picture a big store warning a would-be competitor: open near me and I’ll slash prices until you’re ruined. Frightening — until you fold it back. Suppose the rival opens anyway. Now the store is standing there with the choice already made: keep prices normal and earn, or burn money on a price war that helps no one. Once the rival is in, the war is the irrational move — so a clear-eyed rival reasons all this out in advance, sees the threat for the cheap talk it is, and walks right in. The threat only ever worked on someone who couldn’t reason to the end.

Here’s the unsettling turn. The same cold logic, pushed to its edge, starts predicting things people simply don’t do. Lay a pile of money between two players and let them take turns either grabbing the slightly larger share or passing to let the pot grow. Reason it backward and it unravels instantly: whoever moves last would grab, so the one before grabs first, so the one before that grabs first — all the way back to move one. The airtight prediction is that the very first player snatches a tiny pot and it ends at once. But put real people at the table and they don’t. They pass, the pile grows, and both walk away richer than the logic swore they could. Backward induction is the sharpest tool there is for reasoning a sequence through to its end — and the clearest reminder that the people across the table may not have read the same proof.

Framework & implementation

This section uses Ora’s own terms for the parts of an analysis, so that if you open the actual mode and lens files they line up. Each is glossed in plain language on first use.

Pipeline execution

Backward induction is one of the mental models in Strategic Interaction’s ANALYTICAL PERSPECTIVES block, listed under “always loaded” — so it is active on every strategic-interaction analysis, whether or not the prompt names it. Strategic Interaction runs at Gear 4, Ora’s most thorough setting: a Depth analyst and a Breadth analyst read the situation independently, each critiques the other’s reading, both revise under that critique, and a consolidator merges what survives. The method threads through those stages like this.

Detection. The lens engages on the cases in its Detection Signals — a sequential decision with a known endpoint where each choice changes the options available later; a forward plan that has fanned out into an unmanageable branching tree; an opening move whose value turns on responses many stages away; a multi-round negotiation where the question is the opening offer; a plan against a fixed deadline where the question is what must happen now to land at the desired end state. The precondition is a finite game of sequential moves whose terminal payoffs are known or computable and whose tree is small enough to traverse in reverse.

The Depth and Breadth analysts. Two models read the situation in parallel. The Depth analyst commits to one reading and defends it — these stages, this order of play, these terminal payoffs in each player’s actual value terms (the mode’s CQ5, payoff realism: what behavior reveals, not what parties claim to want) — and runs the lens’s Application Steps: define the decision tree (stages, choices, terminal payoffs); solve the final stage at every leaf; step back one stage and at each node fold in the optimal next-stage response, choosing the best move there given that fold; repeat to the root, where the chosen move is the optimal first action. Because backward induction is the equilibrium method here (the mode’s CQ2, the equilibrium method named), the result it derives is the subgame-perfect equilibrium — a strategy that is rational not just overall but in every branch the game could reach. The Breadth analyst works the same situation at the same time, scanning the structural assumptions the fold-back rests on — above all whether the game is genuinely finite, since applying backward induction to an indefinitely-repeated game, where it never terminates, is the lens’s infinite-game-misapplication failure mode. Neither sees the other’s work.

Cross-adversarial evaluation. Each analyst’s reading is handed to the other to critique against the mode’s criteria. Two of the lens’s signature failures are caught here, keyed to its Critical Questions: treating a backward-induction prediction as descriptively true when the counterparty is behavioral (rationality-assumption failure — the evaluator demands the predicted later-stage moves be checked against how the actual players behave, the lens’s CQ4), and resting the whole result on terminal payoffs that were estimated rather than known (payoff misspecification — errors at the leaf compound through every backward step, so the evaluator calls for sensitivity analysis on the terminal numbers). This is also where the lens earns its sharpest use: testing whether a later-stage threat is credible (the mode’s CQ3, credibility) — fold the game back, and a threat that would be irrational to carry out once its stage is reached is exposed as cheap talk.

Revision and claim-check. The reviser addresses the fixes. Where the reading rests on a factual claim — a real terminal payoff, who actually holds the last move, a market fact that fixes a leaf value — that claim is marked a flagged claim and sent to a web-search tool; it has to resolve against outside sources before the revised draft moves forward.

Consolidation and output. The consolidator merges the two revised readings into one corpus of game-theoretic atoms, and the formatter places them into the mode’s set sections. The method itself lands in Equilibrium analysis — backward induction named as the equilibrium method, the fold-back traced from the last stage to the first so a reader could reproduce it, and the resulting subgame-perfect equilibrium stated. The verdict on whether a later-stage threat survives the fold-back lands in Credibility assessment: the incumbent’s “I’ll start a price war if you enter” is reported as cheap talk precisely because backward induction shows the war is irrational once entry has already happened. The players and their value-terms payoffs land in Players and payoffs, the structural checks (finite-versus-repeated, alternative orderings) in Alternative structures, and what the strategist should actually do in Strategic recommendations — leaving Game classification for the framing of the interaction itself.

What the analysis will not assert. It reports the rational, subgame-perfect line of play and the move it forces now. It does not claim real players will follow that line — backward induction often predicts what people demonstrably do not do, the centipede-paradox limit — so it pairs the rational prediction with a bounded-rationality reading wherever real actors plausibly deviate (the mode’s hyperrationality-trap, very sharp for this lens). The strategist’s own best response and a prediction of the counterparty’s behavior are kept as two separate things.

Origin and evidence

The reasoning is old — Zermelo’s 1913 theorem on chess, presented to the Fifth International Congress of Mathematicians, is usually credited as the first formal use of backward reasoning over a game tree of perfect information. Its modern home is the extensive form (the game-tree representation), set out by Harold Kuhn in 1953, in which a game is drawn as a branching sequence of moves and backward induction is the natural way to solve it. The decisive step was Reinhard Selten’s 1965 work on oligopoly with demand inertia, which defined subgame perfection — the requirement that a strategy be optimal not just for the game as a whole but in every subgame it could reach, ruling out equilibria that rest on threats a player would never actually carry out. Backward induction is the procedure that yields exactly those equilibria; Selten shared the 1994 Nobel Memorial Prize in Economic Sciences for the body of refinement this anchors. The method’s limits are as well-studied as its uses: Robert Rosenthal’s 1981 Journal of Economic Theory paper introduced the centipede game, in which strict backward induction predicts immediate defection on the first move while real players cooperate well into the sequence — the canonical demonstration that the equilibrium is a statement about ideal rationality, not a reliable forecast of human play.

Applications and common uses

Backward induction is the standard engine for any decision that unfolds in stages toward a known end — used both to choose one’s own line of play and to see through the other side’s.

Sequential bargaining. Multi-round negotiation is solved from the final round back: what the last offer must be fixes the round before it, and so on to the opening move. The structure of who can make the last credible offer often decides the whole split — the logic behind alternating-offer bargaining models.
Entry deterrence and predatory-pricing threats. Whether an incumbent’s threat to punish a new entrant is credible is tested by folding the game forward of entry: if the punishment would be irrational once the rival is already in, the threat is cheap talk. This is the chain-store setting Selten and Rosenthal worked, and how antitrust analysts reason about predation.
Finite repeated dealings. When two parties interact a known number of times, backward induction predicts the endgame — cooperation unravels from the last interaction back, because neither side fears retaliation after the final round. Knowing where the unraveling starts is what tells a negotiator when goodwill stops being self-enforcing.
Project and deadline planning. Scheduling against a fixed end date is backward induction without an opponent: fix the deadline, work back through what each milestone requires of the one before it, and the start date and first task fall out. This is the critical-path move — the same fold-back the airport example walks through.
Sequential optimization at scale. When the decision-maker is alone rather than facing a rival, the same fold-back is dynamic programming — the algorithmic generalization used in operations research, control, and reinforcement learning to solve staged problems too large to traverse by hand.

In every case the payoff is the same: the rational line of play traced from the end backward, and — just as valuable — the ability to tell a binding commitment from a threat that falls apart the moment you reason it through.

Failure modes and when not to use it

The lens’s characteristic ways of going wrong are catalogued in its Common Failure Modes:

Infinite-game misapplication. Running the fold-back on a game with no known last stage — an indefinitely-repeated interaction — where backward induction simply never terminates. The tell is that you cannot point to the final move. The repertoire there is folk-theorem analysis, or a finite truncation used as an explicit approximation with its caveats stated.
Rationality-assumption failure. Reporting the backward-induction line as a prediction when the counterparty is behavioral. The construction assumes every player reasons to the end and that this is common knowledge; where the predicted last-stage moves don’t match observed play, the prediction is wrong even when the strategist’s own best response is unchanged. The fix is to model the counterparty’s actual decision rule — limited foresight, fairness preferences, a credible-seeming threat — and re-induct.
Payoff misspecification. Building the fold-back on terminal payoffs that were guessed. Because every backward step inherits the leaf values, an error at the end propagates through the whole chain; the warning sign is an optimal first move that flips on small changes to the terminal numbers. The fix is sensitivity analysis — if the answer is fragile to the payoffs, the analysis is fragile.
Centipede paradox. The lens producing a crisp prediction — immediate defection in a long-cooperation game — that contradicts how people actually play. This is not a bug to patch but a known limit of ideal-rationality reasoning; the move is to supplement it with a behavioral or limited-rationality model rather than trust the cold prediction.

When not to reach for it. When the interaction has no definite end — it repeats indefinitely, or the horizon is genuinely open — the fold-back has nowhere to begin and the lens does not apply. When the players are nowhere near the common-knowledge rationality the method assumes, the predicted line can simply be the wrong forecast, and a bounded-rationality reading has to carry the weight. And when the decision tree is too large to traverse in reverse, full backward induction gives way to its approximations — dynamic-programming methods and heuristics — rather than an exact fold-back.

Strategic Interaction — the analysis that hosts this lens; models situations where actors’ choices act on each other and finds where they settle.
Subgame Perfection — the equilibrium concept backward induction produces: a strategy that is rational in every branch the game could reach, not just overall.
Dynamic Programming — the same fold-back applied to a lone decision-maker rather than a strategic rival; the algorithmic generalization for staged optimization.
Folk Theorems — what replaces backward induction once the game repeats indefinitely and the fold-back no longer terminates.