Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Game Theory›Subgame Perfect Equilibrium
Machine learningGame-theoretic

Subgame Perfect Equilibrium

Subgame Perfect Equilibrium (SPE) with Backward Induction · Also known as: Backward Induction, Sequential Equilibrium, Extensive-Form Equilibrium

Subgame Perfect Equilibrium (SPE) is a refinement of Nash Equilibrium for sequential games, introduced by Reinhard Selten in 1965. It requires that strategy profiles constitute a Nash Equilibrium in every subgame, eliminating non-credible threats and incredible promises. Backward induction is the primary computational method for finding SPE in finite games.

ScholarGate
  1. Machine learning
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Subgame Perfect Equilibrium
Bayesian Nash EquilibriumEvolutionary Game TheoryNash EquilibriumStackelberg Competition

When to use it

Apply SPE analysis to sequential games with incomplete information resolved over time: negotiations, auctions with multiple rounds, entry and exit decisions, or sequential moves in competition. Essential when understanding the order of moves and credibility of commitments matters. Works best for games with perfect or complete information; imperfect information requires refinements such as Perfect Bayesian Equilibrium.

Strengths & limitations

Strengths
  • Eliminates implausible equilibria based on non-credible threats or promises
  • Computationally tractable for finite games using backward induction
  • Uniquely applicable to sequential games where move order and timing are critical
  • Provides a clear decision procedure via explicit algorithm, enabling direct implementation
Limitations
  • Restricted to finite games with perfect recall (no information asymmetries across decision nodes)
  • Exponential complexity as game tree size grows, making large sequential games intractable
  • May yield multiple equilibria in games with simultaneous moves or imperfect information
  • Backward induction is sensitive to game tree representation; different extensive forms can yield different equilibria

Frequently asked

What is the difference between a Nash Equilibrium and a Subgame Perfect Equilibrium?

Every SPE is a Nash Equilibrium, but not vice versa. SPE requires Nash equilibrium play at every subgame, eliminating equilibria sustained by non-credible out-of-equilibrium threats that would never be carried out.

Why does backward induction sometimes seem to predict unrealistic behavior?

Backward induction assumes common knowledge of rationality and perfect information. Real players may have limited foresight, bounded rationality, or imperfect information, making SPE predictions less reliable in practice.

How does SPE handle games with imperfect information?

SPE alone does not directly apply; instead, Perfect Bayesian Equilibrium extends SPE by requiring players to update beliefs about others' types using Bayes' rule and then play optimally given those beliefs.

Sources

  1. Selten, R. (1965). Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit. Zeitschrift für die gesamte Staatswissenschaft, 121, 301-324. link ↗
  2. von Stackelberg, H. (1934). Marktform und Gleichgewicht. Julius Springer. link ↗

How to cite this page

ScholarGate. (2026, June 3). Subgame Perfect Equilibrium (SPE) with Backward Induction. ScholarGate. https://scholargate.app/en/game-theory/subgame-perfect-equilibrium

Related methods

Bayesian Nash EquilibriumEvolutionary Game TheoryNash EquilibriumStackelberg Competition

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Bayesian Nash EquilibriumGame Theory↔ compare
  • Evolutionary Game TheoryGame Theory↔ compare
  • Nash EquilibriumGame Theory↔ compare
  • Stackelberg CompetitionGame Theory↔ compare
Compare side by side →

Referenced by

Nash EquilibriumStackelberg Competition

Similar methods

Bayesian Nash EquilibriumNash EquilibriumStackelberg CompetitionEvolutionary Game TheoryCrisis Bargaining GameDeterrence ModelingArrow-Debreu EquilibriumCournot Competition

Related reference concepts

Game Theory and Bargaining TheoryGame Theory for AgentsNoncooperative GamesOligopoly and Other Forms of Market ImperfectionMicroeconomicsMechanism Design

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Subgame Perfect Equilibrium (Subgame Perfect Equilibrium (SPE) with Backward Induction). Retrieved 2026-07-21 from https://scholargate.app/en/game-theory/subgame-perfect-equilibrium · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Reinhard Selten
Subfamily
Game-theoretic
Year
1965
Type
algorithm
Related methods
Bayesian Nash EquilibriumEvolutionary Game TheoryNash EquilibriumStackelberg Competition
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account