Remove any dominated strategies and find the optimum strategy for each player. 
A. A: 1: 3/13, 2: 10/13
B: 1: 1/13, 2: 12/13
B. A: 1: 9/13, 2: 4/13
B: 1: 5/13, 2: 8/13
C. A: 1: 9/13, 2: 4/13
B: 1: 1/13, 2: 12/13
D. A: 1: 9/13, 2: 4/13
B: 1: 12/13, 2: 1/13
Answer: C
Mathematics
You might also like to view...
Solve the problem.Suppose there are 6 roads connecting town A to town B and 7 roads connecting town B to town C. In how many ways can a person travel from A to C via B?
A. 49 B. 36 C. 42 D. 13
Mathematics
Find the difference.18 - 0
A. 0 B. 36 C. -18 D. 18
Mathematics
Simplify.|51|
A. 51
B. 
C. -51
D. 0
Mathematics
Graph and write in interval notation. x ? 6 and x ? 2
A. [2, 6]
B. [2, 6)
C. (2, 6]
D. (2, 6)
Mathematics