What Is Subgame Perfect Equilibrium in Game Theory? (game theory tutoring)

What Is Subgame Perfect Equilibrium in Game Theory? (game theory tutoring)

Submit Homework

Subgame perfect equilibrium (SPE) is a central idea in game theory tutoring and appears in nearly every microeconomics and strategy course. Students often struggle to understand why backward induction is the method used to compute SPE and how it eliminates non‑credible threats. This page explains what SPE is, how backward induction works, and why it ensures credibility in dynamic games.

In dynamic games, players move sequentially. Backward induction solves the game from the end to the beginning, ensuring optimal play at every decision point.

Why does SPE matter? Because many Nash equilibria rely on threats that players would never actually carry out. SPE eliminates these non‑credible threats by requiring that strategies form a Nash equilibrium in every subgame, not just the full game. Backward induction enforces this by analyzing each decision node as if it were the start of a new game.

This makes SPE the gold standard for analyzing dynamic strategic behavior.

1. Represent the game in extensive form. Draw the game tree with decision nodes, actions, and payoffs.
2. Identify the final decision nodes. These are the endpoints where players choose last.
3. Solve the last mover’s optimal action. Choose the action that gives the highest payoff at each terminal node.
4. Replace the final decision nodes with their optimal payoffs. This collapses the tree one step backward.
5. Move to the previous player’s decision node. Given the future optimal actions, determine the best current action.
6. Repeat until reaching the initial node. The resulting strategy profile is the SPE.
7. Verify credibility. Check that no player deviates in any subgame.

Consider a simple entry‑deterrence game:

• Entrant chooses Enter or Stay Out.
• If Enter, Incumbent chooses Fight or Accommodate.

Payoffs (Entrant, Incumbent):

• Stay Out → (0, 5)
• Enter → Fight → (-5, -5)
• Enter → Accommodate → (3, 3)

Backward induction:

1. If the entrant enters, the incumbent prefers Accommodate (3 > -5).
2. Knowing this, the entrant compares:
   • Stay Out: 0
   • Enter → Accommodate: 3
   Enter is better.

Thus the SPE is:

Entrant: Enter
Incumbent: Accommodate if reached

The threat to Fight is not credible, so SPE eliminates it.

• Confusing Nash equilibrium with subgame perfect equilibrium.
• Failing to analyze every subgame.
• Believing backward induction applies to simultaneous‑move games.
• Ignoring non‑credible threats.
• Thinking SPE always yields unique outcomes.

Subgame perfect equilibrium is essential for analyzing dynamic strategic interactions. It ensures credibility, eliminates unrealistic threats, and provides a consistent method for solving sequential games. Mastering SPE and backward induction is crucial for microeconomics, industrial organization, political economy, and graduate‑level game theory.

This idea connects directly to:

• Game Theory (parent)
• Microeconomics (spoke)
• Economics (parent)
• Tutoring Services
• Question Hub
• Economics Post Hub

Why does backward induction identify the subgame perfect equilibrium in dynamic games?

Answer First

A subgame perfect equilibrium is found by solving the game from the end to the beginning. At each decision node, choose the action that maximizes the player’s payoff, then roll the resulting optimal choices backward through the game tree. The strategy profile that survives this process is the SPE.

Problem Setup

Sequential game with perfect information:

• Players move one after another.
• Each decision node defines a subgame.
• Backward induction solves each subgame starting from the terminal nodes.

Definition: \[ \text{SPE} = \text{strategy profile that induces a Nash equilibrium in every subgame}. \]

Step-by-Step Explanation

1. Start at the terminal nodes

Identify the last mover’s optimal action at each endpoint of the game tree.

2. Replace each terminal node with the resulting payoff

This collapses the game tree by one step.

3. Move one step backward

Now consider the player who moves just before the last mover. Given the collapsed payoffs, choose their best action.

4. Continue collapsing the tree

Repeat the process until you reach the initial decision node.

5. Extract the full strategy profile

The SPE is the set of actions each player would take at every node, not just the path actually played.

Intuition

Backward induction forces players to anticipate future optimal behavior. You solve the game by asking: “If we ever reached this point, what would the player do?” Then you eliminate all non‑credible threats.

Common Exam Mistakes

• Only solving the equilibrium path instead of full strategies.
• Confusing Nash equilibrium with subgame perfect equilibrium.
• Failing to eliminate non‑credible threats.
• Not treating each decision node as a subgame.

Final Summary

To find a subgame perfect equilibrium, solve the game backward from the terminal nodes. At each step, choose the action that maximizes the player’s payoff, collapse the game tree, and continue until reaching the start. The resulting strategy profile is the SPE.

This explanation belongs to the broader Economics Tutoring pillar.

If you want help working through these ideas for coursework or exams, you can talk directly to a tutor, not a marketer.

Call/Text: 510-398-0006
Email: tutor@californiagraduatetutor.com