Lesson 1 of 3Module 2 · 0% of course
Explore › Game Theory › Game Theory Foundations › Dynamic games
Game Theory Foundations · Dynamic games

Sequential games & backward induction

When players move in turn, solve from the end: figure out the last mover's choice, then the one before. This exposes empty threats and shows why commitment is power.

30 min · 7 steps · videoJump to quiz ↓
16. Backward induction: reputation and duels YaleCourses · 30 min
Open in YouTube
Step 1 of 7 · Overview30 min read ·
Key idea
Prereqs: Nash equilibrium. Next: Repeated games & cooperation. Yale ECON 159 Lectures 13–16; Schelling *The Strategy of Conflict*.
Next: 1. Game trees
‹ PrevNext ›