PPT Slide

I

I

II

II

I : 1.7

II: 0.9

I : 0.3

II: 0.7

I : 1.5

II: 1.2

R

R

L

L

l

l

r

r

In a finite game of perfect information players move in turns or simultaneously. In the first case the game can be visualised by a game tree with nodes for a player’s turns and edges for decisions. Final nodes describe each player’s results. Any path from the root to a final node is a possible play of the game.

I : 2.7

II: 0.8

I : 1.6

II: 1

extensive forms

Previous slide

Next slide

Back to first slide

View graphic version