# L6 - Extensive Games with Imperfect Information Extensive...

This preview shows pages 1–12. Sign up to view the full content.

Page 1 of 49 Extensive Games with Imperfect Information Extensive games with imperfect information are extensive games in which the players are imperfectly informed about some or all of the choice that have already been made.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Page 2 of 49 E XAMPLE . 1 2 1 0,0 1,2 1,2 0,0 2,1 A B L R l r l r
Page 3 of 49 Player 1 s information sets : {} and {( , ),( , )} L A L B . Player 2 s information set : L . 1 2 1 0,0 1,2 1,2 0,0 2,1 A B L R l r l r

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Page 4 of 49 D EFINITION . An extensive game has the following components. A set N (the set of players ). A set H of sequences (finite or infinite) that satisfies the following three properties. The empty sequence is a member of H . If 1, , () k kK aH (where K may be infinite) and LK , then 1, , k kL . If an infinite sequence 1 k k a satisfies 1, , k for every positive integer L then 1 k k .
Page 5 of 49 ( H is the set of histories . A history 1, , () k kK aH is terminal if it is infinite, or if there is no 1 K a such that 1, , 1 k  . ZH is the set of terminal histories.) A function P that assigns to each nonterminal sequence (each member of \ HZ ) a member of {} Nc . ( P is the player function , Ph being the player who takes an action after the history h . If P h c then chance determines the action taken after the history h .)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Page 6 of 49 A function c f that associates with every history h for which () P h c a probability measure c fh on Ah , where each such probability measure is independent of every other such measure. ( c f a h is the probability that a occurs after the history h .)
Page 7 of 49 E XAMPLE . Players information partitions : 1 information set information set { { } ,{( , ),( , )}} L A L B  . 2 information set { { } } L . 1 2 1 0,0 1,2 1,2 0,0 2,1 A B L R l r l r

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Page 8 of 49 (Something new ) For each player iN a partition i of  { : ( ) } h H P h i with the property that ( ) ( ) A h A h whenever h and h are in the same member of the partition. For ii I we denote by () i AI the set Ah and by i PI the player Ph for any i hI . ( i is the information partition of player i ; a set I is an information set of player i .)
Page 9 of 49 For each player iN a preference relation i on lotteries over Z (the preference relation of player i ) that can be represented as the expected value of a payoff function defined on Z .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Page 10 of 49 Extensive Game with Imperfect Information: , , , ,( ),( ) c i i N H P f . COMPARE Extensive Game with Perfect Information: , , , ,( ) ci N H P f .
Page 11 of 49 Player i cannot distinguish between h and h if these two histories are in the same information set: ii hI  and . He only knows that some history in i I has occurred.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/23/2010 for the course CSC CSC5350 taught by Professor Leunghofung during the Winter '09 term at CUHK.

### Page1 / 49

L6 - Extensive Games with Imperfect Information Extensive...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online