Chapter 15

1. A constant K is added to each element of a pay-off matrix related to a game. What effect will
it have on the solution?
(a) The optimal strategies of the players and the value of the game remain unchanged.
(b) The optimal strategies of the players do not change while the value of the game will
increase by K.
(c) The optimal strategies of the players as well as game value will all change.
(d) Nothing sure can be said about it.
2. In a 2-player game having a saddle point, A is the maximising player with three strategies.
The three strategies have payoffs ranging as follows:
A1: -8 to 12
A2: 6 to 18
A3: 2 to 21
The optimal strategy for A is
(a) A1
(b) A2
(c) A3
(d) Is not determinable from the given information.
3. In a 2-person game having saddle point, player B is the minimising player. B has 3 strategies
available to him: b1, b2 and b3. For each of these it is known that:
b1 : lowest payoff 2
highest payoff 21
b2 : lowest payoff -7
highest payoff 14
b3 : lowest payoff 6
highest payoff 8
What is the payoff associated with the optimal strategy of B?
(a) 21
(b) 6
(c) 8
(d) Cannot be determined from the given information.
4. Mark the correct statement:
(a) A game is said to be fair if each of the players has equal number of strategies.
(b) The value of the game can be determined only if the game has a saddle point.
(c) Player A is said to dominate the other if he has more strategies to play.
(d) A game favours minimising player B if it has negative value.
5. Mark the wrong statement:
(a) If each of the payoffs for a column strategy is equal to or greater than the corresponding
payoff of another column strategy, the former is said to dominate the latter.
(b) The game has a saddle point if the payoffs associated with maximin and minimax
strategies are the same.
(c) A game can have multiple saddle points.
(d) The game value can be positive, negative or zero.

6. Mark the wrong statement:

(a) The solution to a game by graphic method may or may not be same as obtained by
analytic method.
(b) Any two-player game can be formulated and solved as an LPP.
(c) The players have to play mixed strategies when saddle point to a game does not exist.
(d) If the value of the game = 0, the game is said to be favouring none of the players.
7. For a two-person game where A and B are, respectively, the minimising and maximising
players, the optimal strategies are:
(a) Maximax for A and minimin for B
(b) Maximin for A and minimax for B
(c) Minimax for A and maximin for B
(d) Minimin for A and maximax for B
8. Given the following payoff matrix for a game:
Player B
a1
a2
Player A a3
a4

b1
6
8
2
7

b2
2
6
5
6

b3
8
3
6
1

b4
12
10
9
8

Which of the following statements is not true about this?

(a) b1 dominates b4
(b) a2 dominates a4
(c) The game has no saddle point.
(d) The game cannot be solved.
9. The given payoff matrix of a game is transposed. Which of the following does not happen?
(a) The game value changes.
(b) The saddle point changes.
(c) A has as many strategies as B had, and B has as many strategies as A had.
(d) The optimal strategies of the players do not change.
10. Mark the correct statement:
(a) If one player has 2 strategies available to him while the other has more than 2, they are
sure to play mixed strategies.
(b) In mixed strategies, the value of game for both the players need not be the same.
(c) If the optimal policy for A is found to be (8/13, 5/13) it implies that in long run games,
he would play the first strategy and the second strategy at random in the ratio 8:5
(d) If the optimal solution to a game results in pure strategies, it implies that it has no saddle
point.