1. Show that, in a two-person game with payoff matrix

the only games that are not strictly determined are those for which either
a11 > a12, a11 > a21, a21 or
a11 a22, a12 > a22
2. In Check Your Understanding Problem 1 in Section 9.3, we determined the optimal strategy for C in a game with payoff matrix

To be

Consider the effect of changing the entry in the first row, first column of the payoff matrix to 2 + h, where h is any positive integer. For what values of h does the optimal strategy for C remain the same?

Transcribed Image Text:

d12 Lazi a2. 14 12