Tutorial8

Tutorial8 - CSC5350 Game Theory in Computer Science...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC5350 Game Theory in Computer Science Tutorial 8 CHEN Wenhao whchen@cse.cuhk.edu.hk SHB 905
Background image of page 1

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

View Full DocumentRight Arrow Icon
Outline ± Please come and take your assignment in my office SHB 905. ± Extensive ame with imperfect information te s e ga e t pe ect o at o ± Strategies ± Pure ± Mixed ± Behavioral ash equilibrium ± Nash equilibrium
Background image of page 2
Extensive game g with imperfect information ± Players move one by one ± Players DO NOT know what action ther players have made other players have made
Background image of page 3

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

View Full DocumentRight Arrow Icon
Extensive game g with imperfect information ± Five components et of players ± Set of players ± Set of terminal histories ± the set of all sequences of actions that may occur qy ± Player function ± assigns a player to every subhistory ± Preferences over the set of terminal histories ± Player s information partition ± A set of information sets ± Information set: a set of histories that is indistinguishable to the player
Background image of page 4
Example 1 ± Player 1 receives a card that is either H or L with equal probabilities ± Player 2 does not see the card ± Player 1 may ± announce that her card is L and pay $1 to player 2 ± or claim that her card is H ± player 2 may choose to concede and pay $1 to player 1 r to insist on seeing player 1 cardand ± or to insist on seeing player 1 s card and ± player 1 pay him $4 if her card is L and ± he must pay her $4 if her card is H
Background image of page 5

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

View Full DocumentRight Arrow Icon
Example 1
Background image of page 6
Example 1 ± Set of players: {1, 2} et of terminal histories ± Set of terminal histories ± {(H, L), (H, H, C), (H, H, N), (L, H, C), (L, H, N), (L, L)} ±
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 30

Tutorial8 - CSC5350 Game Theory in Computer Science...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online