We first discuss Zermelo's theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for player 2 to force a win. The proof is by induction. Then we formally define and informally discuss both perfect information and strategies in such games. This allows us to find Nash equilibria in sequential games. But we find that some Nash equilibria are inconsistent with backward induction. In particular, we discuss an example that involves a threat that is believed in an equilibrium but does not seem credible.

📑 Lecture Chapters:

First and Second Mover Advantages: Zermelo's Theorem [00:00:00]
Zermelo's Theorem: Proof [00:10:17]
Zermelo's Theorem: Generalization [00:17:06]
Zermelo's Theorem: Games of Induction [00:31:20]
Games of Perfect Information: Definition [00:40:27]
Games of Perfect Information: Economic Example [01:01:56]

Source: Ben Polak, Game Theory (Yale University: Open Yale Courses). Licensed under CC BY-NC-SA 3.0.