Lecture 14 - Backward Induction: Commitment, Spies, and First-Mover Advantages

1:07:06 Free

We first apply our big idea--backward induction--to analyze quantity competition between firms when play is sequential, the Stackelberg model. We do this twice: first using intuition and then using calculus. We learn that this game has a first-mover advantage, and that it comes commitment and from information in the game rather than the timing per se. We notice that in some games having more information can hurt you if other players know you will have that information and hence alter their behavior. Finally, we show that, contrary to myth, many games do not have first-mover advantages.

📑 Lecture Chapters:

Sequential Games: First Mover Advantage in the Stackelberg Model [00:00:00]
First Mover Advantage: Commitment Strategy [00:38:13]
First Mover Advantage: Why It Is Not Always an Advantage [00:49:25]
First and Second Mover Advantage: NIM [00:55:53]

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

Hypha Official

Watch what matters. Create what pays.

ECON 159: Game Theory

This course is an introduction to game theory and strategic thinking. Ideas such as dominance, backward induction, Nash equilibrium, evolutionary stability, commitment, credibility, asymmetric information, adverse selection, and signaling are discussed and applied to games played in class and to examples drawn from economics, politics, the movies, and elsewhere.