Lecture 18 - Imperfect information: information sets and sub-game perfection
recorded by: Yale University
published: Nov. 15, 2010, recorded: September 2007, views: 3510
released under terms of: Creative Commons Attribution No Derivatives (CC-BY-ND)
See Also:
Download yaleecon159f07_polak_lec18_01.mov (Video - generic video source 633.1 MB)
Download yaleecon159f07_polak_lec18_01.flv (Video 274.3 MB)
Download yaleecon159f07_polak_lec18_01_640x360_h264.mp4 (Video 227.3 MB)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Reading assignment:
Strategies and Games: Theory And Practice. (Dutta): Chapter 13
Strategy: An Introduction to Game Theory. (Watson): Chapters 15-16, 19
Resources:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: