Skip to content

Subgame Perfect Equilibrium

Refine the Nash equilibria of a sequential game by keeping only strategy profiles that prescribe a best response in every subgame, discarding outcomes propped up by threats a player would never actually carry out.

Core Idea

Subgame perfect equilibrium (SPE) refines Nash equilibrium for extensive-form games — games drawn as a tree of decision nodes, actions, and terminal payoffs. A strategy profile is subgame perfect if it prescribes a Nash equilibrium in every subgame reachable from any node, including off-path ones. This eliminates equilibria sustained by non-credible threats: promises to take actions the threatener would find irrational to execute once that node was reached.

Scope of Application

SPE operates wherever a sequential game can be written as an extensive-form tree with well-defined subgames, information sets, and terminal payoffs.

  • Industrial organization — Stackelberg leader-follower, entry deterrence, the chain-store paradox.
  • Bargaining theory — Rubinstein's alternating offers yields a unique patience-determined division.
  • Mechanism design and contracts — what offer a principal can credibly make sequentially.
  • Repeated-game folk theorems — payoffs sustainable by credible trigger strategies.
  • Political economy — legislative bargaining, electoral commitment, dynamic policymaking.

Clarity

SPE draws a distinction plain Nash cannot: between equilibrium strategies that remain optimal wherever the game might actually arrive and those propped up by threats a player would never execute. Requiring Nash play in every subgame exposes such promises as non-credible, dissolving the conflation of what a player announces with what is sequentially rational once the moment arrives. Where this bites, SPE often yields a unique prediction.

Manages Complexity

A sequential game's Nash equilibria form a sprawling set, since any untested off-path threat can prop up an outcome. SPE collapses screening to one local yes/no question per decision node: is the prescribed action a best response starting here? Backward induction supplies the engine — solve the last node, fold its rational choice into the previous one, recurse to the root — replacing enumeration of every path with a single sweep.

Abstract Reasoning

SPE licenses a diagnostic move (test a threatened action for sequential rationality and discard bluff-sustained equilibria) and a predictive move (fold the tree back from its leaves to a unique outcome, as in Rubinstein bargaining). It also draws a validity boundary (predictions hold only under common knowledge of rationality, full backward visibility, finite horizon, no trembling) and licenses commitment reasoning (alter future payoffs to make a threat credible).

Knowledge Transfer

Within game theory and applied economics SPE transfers as a solution concept: the credibility criterion and backward-induction engine carry into industrial organization, bargaining, mechanism design, folk theorems, and political economy wherever a game is a tree with well-defined subgames. Beyond that, the machinery does not survive stripping the extensive-form scaffold; what genuinely travels — distrust empty threats, and make a deterrent bind by pre-committing — is the parent prime commitment_device and Schelling's commitment problem.

Relationships to Other Abstractions

Local relationship map for Subgame Perfect EquilibriumParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Subgame PerfectEquilibriumDOMAINPrime abstraction: Nash Equilibrium — is a kind ofNash EquilibriumPRIMEDomain-specific abstraction: Centipede Game — is part ofCentipede GameDOMAINDomain-specific abstraction: Folk Theorem (Repeated Games) — is part of, typicalFolk Theorem(Repeated Games)DOMAINDomain-specific abstraction: Pirate game — is part ofPirate gameDOMAINDomain-specific abstraction: Ultimatum Game — is part ofUltimatum GameDOMAIN

Current abstraction Subgame Perfect Equilibrium Domain-specific

Parents (1) — more general patterns this builds on

  • Subgame Perfect Equilibrium is a kind of Nash Equilibrium Prime

    Subgame-perfect equilibrium is the Nash species that also requires Nash play in every proper subgame, including subgames off the equilibrium path.

Children (4) — more specific cases that build on this

  • Centipede Game Domain-specific is part of Subgame Perfect Equilibrium

    The canonical centipede construction contains its subgame-perfect solution, whose every-node credibility requirement yields take on the first move.

  • Folk Theorem (Repeated Games) Domain-specific is part of, typical Subgame Perfect Equilibrium

    The modern repeated-game folk theorem contains subgame perfection as the credibility standard for the punishment strategies sustaining its payoff region.

  • Pirate game Domain-specific is part of Subgame Perfect Equilibrium

    The pirate game contains a subgame-perfect solution in which each proposed coalition is priced from the next continuation game's equilibrium payoff.

  • Ultimatum Game Domain-specific is part of Subgame Perfect Equilibrium

    The Ultimatum Game contains the minimal-offer, accept-any-positive-share subgame-perfect solution as the benchmark its behavioral reading falsifies.

Hierarchy paths (3) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Subgame Perfect Equilibrium sits in a crowded region of the domain-specific corpus (2nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Strategic Interaction & Game Theory (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12