Session 18 - Imperfect information: information sets and sub-game perfection
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.
ECON 159: Game Theory
|
Lecture 18 -
Imperfect information: information sets and sub-game perfection |
Overview:
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.
Reading assignment:
Strategies and Games: Theory And Practice. (Dutta): Chapter 13
Strategy: An Introduction to Game Theory. (Watson): Chapters 15-16, 19
|
Yale University 2011. Some rights reserved. Unless otherwise indicated in the applicable Credits section of certain lecture pages, all content on this web site is licensed under a Creative Commons License. Please refer to the Credits section to determine whether third-party restrictions on the use of content apply. |













