values Ct.

; and ~j are constant and are - 1 and + 1

respectively, the lower and upper values of the game are also
-1 and + 1:
Ct.=-l; ~=+1
Either strategy of player A is a maximin strategy, and either
strategy of player B is a minimax strategy. The conclusion that
follows is trivial: by adopting any of his strategies, player A
can assure that his loss is not greater than 1; the same can also
be guaranteed by player B.
EXAMPLE 2. Example 2 of Section 1 gives a game with the
following matrix.
The lower value of the game rJ. = - 3~ the upper value of the
game ~ = 4. Our maximin strategy is A 1 ; employing it systematically
we can count on a gain not less than - 3 (a loss not greater
than 3). The opponent's minimax strategy is either of the
17

~ 8 1 8 2 8 3 ("ji

AI 2 -3 4 -3
A2 -3 4 -5 -5
A3 4 -5 6 -5
Pi 4 4 6
strategies B1 or B2 ; employing them systematically he can in any case
guarantee that his loss is not greater than 4. If we deviate from
our maximin strategy (choose strategy A2 , for instance) our opponent
may "punish" us for this by playing strategy B3 and reducing
our gain to -5; similarly our opponent's deviation from his
minimax strategy may increase his loss to 6.
EXAMPLE 3. Example 3 of Section 1 gives a game with the
matrix

~ 8 1 8 2 8 3 (J.i

AI 0.9 0.4 0.2 0.2

A2 0.3 0.6 0.8 0.3
A3 0.5 0.7 0.2 0.2
Pi 0.9 0.7 0.8