DiscoverYale Open Courses ECON 159: Game TheoryLecture 18 - Imperfect Information: Information Sets and Sub-Game Perfection
Lecture 18
 - Imperfect Information: Information Sets and Sub-Game Perfection

Lecture 18 - Imperfect Information: Information Sets and Sub-Game Perfection

Update: 2018-06-08
Share

Description

We consider games that have both simultaneous and sequential components, combining ideas from before and after the midterm. We represent what a player does not know within a game using an information set: a collection of nodes among which the player cannot distinguish. This lets us define games of imperfect information; and also lets us formally define subgames. We then extend our definition of a strategy to imperfect information games, and use this to construct the normal form (the payoff matrix) of such games. A key idea here is that it is information, not time per se, that matters. We show that not all Nash equilibria of such games are equally plausible: some are inconsistent with backward induction; some involve non-Nash behavior in some (unreached) subgames. To deal with this, we introduce a more refined equilibrium notion, called sub-game perfection.
Comments 
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 18
 - Imperfect Information: Information Sets and Sub-Game Perfection

Lecture 18 - Imperfect Information: Information Sets and Sub-Game Perfection

William Sheppard