Chapter 9.1, Problem 21E

In Exercises 21 and 22, mark each statement True or False. Justify each answer.

21.

1. a. The payoff matrix for a matrix game indicates what R wins for each combination of moves.
2. b. With a pure strategy, a player makes the same choice each time the game is played.
3. c. The value v(x) of a particular strategy x to player R is equal to the maximum of the inner product of x with each of the columns of the payoff matrix.
4. d. The Minimax Theorem says that every matrix game has a solution.
5. e. If row s is recessive to some other row in payoff matrix A, then row s will not be used (that is, have probability zero) in an optimal strategy for (row) player R.