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

**Takeaway Points**

- A
*subgame perfect equilibrium*is an equilibrium in which all actions are Nash equilibria for all subgames. - 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.