Step 1: Convert tree into *.txt file.
15 14
1 2 1 0 0
1 3 1 0 0
2 4 2 0 0
2 5 2 0 0
3 6 2 0 0
3 7 2 0 0
4 8 1 3 8
4 9 1 7 9
5 10 1 1 2
5 11 1 2 1
6 12 1 10 4
6 13 1 0 5
7 14 1 4 0
7 15 1 8 3
First line: number of nodes, number of edges.
Remaining lines: parent node, child node, player number, player 1 payoff, player 2 payoff.
Step 2: Upload and submit file.
Step 3: Investigate the output.
Upload: ex15_1b.txt
Type: text/plain
Size: 0.1640625 kB
15 14
1 2 1 0 0
1 3 1 0 0
2 4 2 0 0
2 5 2 0 0
3 6 2 0 0
3 7 2 0 0
4 8 1 3 8
4 9 1 7 9
5 10 1 1 2
5 11 1 2 1
6 12 1 10 4
6 13 1 0 5
7 14 1 4 0
7 15 1 8 3
N1 [P1] (0,0) --- 2[P2] 3[P2]
N2 [P2] (0,0) --- 4[P1] 5[P1]
N3 [P2] (0,0) --- 6[P1] 7[P1]
N4 [P1] (0,0) --- 8[P-1] 9[P-1]
N5 [P1] (0,0) --- 10[P-1] 11[P-1]
N6 [P1] (0,0) --- 12[P-1] 13[P-1]
N7 [P1] (0,0) --- 14[P-1] 15[P-1]
N8 [P-1] (3,8) ---
N9 [P-1] (7,9) ---
N10 [P-1] (1,2) ---
N11 [P-1] (2,1) ---
N12 [P-1] (10,4) ---
N13 [P-1] (0,5) ---
N14 [P-1] (4,0) ---
N15 [P-1] (8,3) ---
total number of strategies for player 1 = 32
total number of strategies for player 2 = 4
pure nash equ. found in normal form at position (29,2), with payoff vector (10,4)
- player 1 strategy is: 3 9 11 12 15
- player 2 strategy is: 5 6
