Backward Induction

This lecture introduces backward induction, the most common solution algorithm for extensive form games.

Takeaway Points

  1. A subgame perfect equilibrium is an equilibrium in which all actions are Nash equilibria for all subgames.
  2. We can find such equilibria by starting using backward induction, which instructs us to start at the last action and work our way progressively backward from there.

Back to Game Theory 101