Write down the underlying tree structure as a pair of nodes and edges, just as is done in the examples in the handout.. Write down the list of terminal nodes, just as is done in the examples in the handout.
Consider the following game:
1
———^———-
A | x0 | B
| |
2 3
———-^— —-^———-
C | x1 | D E | x2 | F
| | | |
x3 1………..1 x6
$1 ——-^– –^——– $1
$1 G | x4 | H G | x5 | H $1
$1 | | | | $1
x7 x8 x9 x10
$0 $2 $2 $0
$1 $1 $1 $1
$2 $0 $0 $2
Your task is this: write down the game pictured here in extensive-form.
In your answer, be sure to complete the following tasks:
Write down the list of players, just as is done in the examples in the handout.
Write down the underlying tree structure as a pair of nodes and edges, just as is done in the examples in the handout..
Write down the list of terminal nodes, just as is done in the examples in the
handout.