DiscoverYale Open Courses ECON 159: Game TheoryLecture 19 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments
Lecture 19
 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments

Lecture 19 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments

Update: 2018-06-081
Share

Description

We analyze three games using our new solution concept, subgame perfect equilibrium (SPE). The first game involves players’ trusting that others will not make mistakes. It has three Nash equilibria but only one is consistent with backward induction. We show the other two Nash equilibria are not subgame perfect: each fails to induce Nash in a subgame. The second game involves a matchmaker sending a couple on a date. There are three Nash equilibria in the dating subgame. We construct three corresponding subgame perfect equilibria of the whole game by rolling back each of the equilibrium payoffs from the subgame. Finally, we analyze a game in which a firm has to decide whether to invest in a machine that will reduce its costs of production. We learn that the strategic effects of this decision–its effect on the choices of other competing firms–can be large, and if we ignore them we will make mistakes.
Comments 
loading
In Channel
loading
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Lecture 19
 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments

Lecture 19 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments

William Sheppard