An Introduction to Game Theory Part V: Extensive Games with Perfect Information. Bernhard Nebel. Motivation. So far, all games consisted of just one simultaneous move by all players Often, there is a whole sequence of moves and player can react to the moves of the other players
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
An Introduction to Game TheoryPart V: Extensive Games with Perfect Information
Bernhard Nebel
(similar to chicken – but here we have a sequence of moves!)
An extensive games with perfect information consists of
ui(O(s*i,s*i)) ≥ ui(O(s*i,si))
How many subgames are there?
1
(2,0)
(1,1)
(0,2)
2
2
2
+

+

+

(2,0)
(0,0)
(1,1)
(0,0)
(0,2)
(0,0)
Only
1
(2,0)
(1,1)
(0,2)
2
2
2
+

+

+

(2,0)
(0,0)
(1,1)
(0,0)
(0,2)
(0,0)
1
2
1
2
1
2
C
C
C
C
C
7,5
S
S
S
S
S
S
1,0
0,2
3,1
2,4
5,3
4,6