UNIT-2 (GAME THEORY) MCQ
1. A two-person zero-sum game means that the
(a) the sum of losses to one player is equal to the sum of gains to other
(b)the sum of losses to one player is not equal to the sum of gains to other
(c)no any player gains or losses
(d)none of these
2. Game theory models are classified by the
(a)number of players
(b)sum of all payoffs
(c)number of strategies
(d)all of these
3. A game is said to be fair if
(a)both upper and lower values of the game are the same and zero
(b)upper and lower values of the game are not equal
(c)upper value is more than the lower value of the game
(d)none of these
4. What happens when maximin and minimax values of the game are same?
(a)no solution exists
(b)solution is mixed
(c)saddle point exists
(d)none of these
5. A mixed strategy game can be solved by
(a)algebraic method
(b)matrix method
(c)graphical method
(d)all of these
6. The size of the payoff matrix of a game can be reduced by using the principle of
(a)game inversion
(b)rotation reduction
(c)dominance
(d)game transpose
7. The payoff value for which each player in a game always selects the same strategy is called
the
(a)saddle point
(b)equilibrium point
(c)both (a) and (b)
(d)none of these
8. Games which involve more than two players are called
(a)conflicting games
(b)negotiable games
(c)N-person games
(d)all of these
9. When the sum of gains of one player is equal to the sum of losses to another player in a game,
this situation is known as
(a)biased game
(b)zero-sum game
(c)fair game
(d)all of these
10. When no saddle point is found in a payoff matrix of a game, the value of the game is then
found by
(a)reducing the size of the game to apply the algebraic method
(b)solving any one 2x2 subgame
(c)finding the average of all the values of the payoff matrix
(d)none of these
11. If a two-person zero-sum game is converted to a Linear Programming Problem,
(a)Number of variables must be two only,
(b)There will be no objective function
(c)If row player represents Primal problem, Column player represent Dual problem
(d)The number of constraints is two only
12. In case, there is no saddle point in a game then the game is
(a)Deterministic game
(b)Fair game
(c)Mixed strategy game
(d)Multiplayer game.
13. When Minimax and Maximin criteria matches, then
(a)A fair game exists.
(b)Unfair game exists,
(c)Mixed strategy exists
(d)Saddle point exists
14. When there is dominance in a game then
(a)Least of the row ≥ highest of another row
(b)Least of the row ≤ highest of another row
(c)Every element of a row ≥ corresponding element of another column
(d)Every element of the row ≤ corresponding element of another row.
15. When the game is not having a saddle point, then the following method is used to solve the
game:
(a)Linear Programming method,
(b)Minimax and maximin criteria
(c)Algebraic method
(d)Graphical method
16. If there are more than two persons in a game then the game is known as:
(a)Non-zero-sum game
(b)Open game
(c)Multiplayer game
(d)Big game
17. A competitive situation is known as
(a)Competition
(b)Marketing
(c)Game
(d)None of these
18. One of the assumptions in the game theory is
(a)All players act rationally and intelligently
(b)The winner alone acts rationally
(c)Loser acts intelligently
(d)Both the players believe luck
19. A play is played when
(a)The manager gives green signal
(b)Each player chooses one of his courses of action simultaneously
(c)The player who comes to the place first says that he will start the game
(d)When the latecomer says that he starts the game.
20. The list of courses of action with each player ...............
(a)is finite
(b)is infinite
(c)three only
(d)none of these
21. A game involving ‘n’ persons is known as:
(a)Multi member game
(b)Multi player game
(c)n - person game
(d)not a game
22. Theory of games and economic behavior is published by:
(a)John Von Neumann and Morgenstern
(b)John Flood
(c)Bellman and Neumann
(d)Mr. Erlang
23. A saddle point exists when
(a)maximin value = maximax value
(b)minimax value = minimum value
(c)minimax value = maximin value
(d)none of these
24. In a pure strategy game
(a)any strategy may be selected arbitrarily
(b)a particular strategy is selected by each player
(c)both players select their optimal strategy
(d)none of these
25. In a mixed strategy game
(a)no saddle point exists
(b)each player selects the same strategy without considering other player’s choice
(c)each player always selects the same strategy
(d)all of these
26. Linear programming method should be used to determine the value of the game when the
size of the payoff matrix is
(a)2 x 2
(b)3 x 4
(c)m x 2
(d)2 x n
27. Game theory is the study of
(a)selecting optimal strategies
(b)resolving conflict between players
(c)giving equal outcome to participants
(d)none of these
28. If the value of the game is zero, then the game is known as:
(a)Fair strategy
(b)Pure strategy
(c)Pure game
(d)Mixed strategy
29. The games with saddle points are
(a)Probabilistic in nature,
(b)Normative in nature
(c)Stochastic in nature,
(d)Deterministic in nature.
30. When the game is played on a predetermined course of action, which does not change
throughout the game, then the game is said to be
(a)Pure strategy game
(b)Fair strategy game
(c)Mixed strategy game
(d)Unsteady game
31. If the losses of player A are the gins of the player B, then the game is known as
(a)Fair game
(b)Unfair game
(c)Non- a zero-sum game
(d)Zero-sum game
32. Identify the wrong statement:
(a)A game without saddle point is probabilistic
(b)Game with saddle point will have pure strategies
(c)Game with saddle point cannot be solved by dominance rule
(d)Game without saddle point uses mixed strategies
