PART A

1. Choose the correct answer:

In a zero-sum game,
a) what one player wins, the other loses.
b) the sum of each player’s winnings if the game is played many times must be zero.
c) the game is fair each person has an equal chance of winning.
d) long-run profits must be zero.
2. What happens when maximin and minimax value of the game are same?
(a) No solution exists
(b) Solution is mixed
(c) Saddle point exists
(d) None of the above
3. A saddle points exists when
(a) Maximinvalue=maximaxvalue
(b) Minimaxvalue=minimum value
(c) Minimaxvalue=maximinvalue
(d) None of the above
4. What happens when maximin and minimax value of the game are same?
(a) No solution exists
(b) Solution is mixed
(c) Saddle point exists
(d) None of the above
5. Two person zero sum game means that the:
a) Sum of losses to one player equals the sum of gains to other
b) The sum of loses to one player is not equal to the sum of gains to other
c) Both (a) and (b)
d) None of the above
6.
Game the or models are classified by the
(a)Number of players
(b)sum of all pay offs
(c)Number of strategies
(d)all of the above
7.
A mixed strategy game can be solved by
(a)algebraic method
(b)matrix method
(c)graphical method
(d)all of the above
8. 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 the above
9. In a pure strategy game
(a) Any strategy may be selected arbitrarily
 (b) A particular strategy is selected by each player
(c) Both player always selects their optimal strategy
(d) None of the above
10. In a mixed strategy game
(a) No saddle points exists
(b) Each player always selects same strategy
(c) Eachplayeralwaysselectssamestrategywithoutconsideringotherplayer’schoice
(d) All of the above
11. What is game in game theory?
12. Define strategy of game in game theory.
13. Define zero sum game in game theory.
14. Define N person game in game theory.
15. Define value of game in game theory.
16. Game theory is the study of
(a) Selecting optimal strategies
(b) Resolving conflict between players
(c) (c) both (a) and (b)
(d) None of the above
17. Define a fair game.
18. Define pure strategy in game theory.
19. Define mixed strategy in game theory.
20. Define player in game theory.
21. A game is said to be fair if :
a) both upper and lower values of the game are same and zero.
b) upper and lower values of the game are not equal
c) upper value is more than lower value of the game
d) none of the above

22. 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
23. A game is said to be ----- if lower and upper values of the game are same as well as zero.
24. The concept of ----- is used in simplifying the solution of a rectangular game.
25. Define value of the game in game theory.
26. Define saddle point.
27. Name any two methods used to solve mixed strategy problem.
28. The rule of ----- are used to reduce the size of the payoff matrix.
29. The course of action that puts any player in the most preferred position irrespective of the
course of action chosen by the competitor is called -----.
30. Define player in game theory.
PART B

1. Define maximin-minimax principle.

2. What are the mixed strategies?
3. List out properties of game.
4. Mention the rules for dominance.
5. What is pay off matrix? Give an example.
6. What are the properties of a game ?
7. State the principle of dominance.
8. Differentiate between pure strategy and mixed strategies.
9. State minimax-maximin principles.
10. Illustrate payoff matrix with an example.
6 2
11. Find the value of the game from the following game matrix, [ ].
−1 4
1 −2
12. Find the value of the game from the following game matrix, [ ].
2 −1
15 2 3
13. Find the value of the game from the following game matrix, [ 6 5 7].
−7 4 0
3 2 4
14. Find the value of the game from the following game matrix, [−2 1 −3].
0 −2 3
5 3 2
15. Find the value of the game from the following game matrix, [1 −2 0].
8 −1 1
16. For what value of λ, the game with the following matrix is determinable
𝜆 6 2
[−1 𝜆 −7].
−2 4 𝜆

15 2 3
17. Find the value of the game from the following game matrix, [ 6 5 7].
−7 4 0
−3 −2 6
18. Find the value of the game from the following game matrix, [ 2 0 2 ].
5 −2 −4
6 8 6
19. Find the value of the game from the following game matrix, [ ].
4 12 2
1 3 1
20. Find the value of the game from the following game matrix, [0 −4 −3].
1 5 −1
21. Define pure strategies in game theory.
6 2 7
22. Express the following game problem into an LPP. [ ]
1 9 3
3 −1 7
23. Express the following game problem into an LPP. [ ]
0 9 3
1 −1 7
24. Express the following game problem into an LPP. [ ]
−3 0 1
1 −5 0
25. Express the following game problem into an LPP. [ ]
1 −2 6
 9 1 4
26. Express the following game problem into an LPP. [0 6 3]
5 2 8
−1 1 1
27. Express the following game problem into an LPP. [ 2 −3 1]
0 2 1
1 0 0
28. Express the following game problem into an LPP. [0 1 −1]
0 0 1
4 0 1
29. Express the following game problem into an LPP. [0 0 0]
3 −8 0
−1 1 −2
30. Express the following game problem into an LPP. [−1 1 −2]
0 1 −3
31. Consider h following payoff matrix
𝑎 𝑏
player B player A[ ]. Then give the equations for finding probability for A using
𝑐 𝑑
strategy 1(p) and probability for B choosing strategy 1(q).
32. Consider h following payoff matrix
𝑎 𝑏
player B player A[ ]. Then give the equations for finding probability for A using
𝑐 𝑑
strategy 1(p) and value of the game(v).
33. Explain graphic method of solving a game.
34. Explain with an example ‘graphic method of solving a 2×n game’.
35. Explain with an example ‘graphic method of solving a m×2 matrix’.
36. Define (i) player (ii) payoff.
37. Define (i) game (ii) value of a game.
38. Describe payoff matrix with an example.
39. Give any two importance of game theory.
40. With an example explain maximin and minimax principle.

PART C
1. What are the assumptions of a game in game theory?
2. Explain briefly on ‘probability method’.
3. State the major limitations of game theory.
4. What are the assumptions of in two person zero sum game?
5. Illustrate probability method in game theory with an example.
6. Mention the characteristics of a competitive game.
7. List the features of a competitive game.
8. Explain briefly on ‘two person zero sum game’.
9. Illustrate with example ‘principle of dominance’.
10. Write a short note on ‘game theory’.
11. Solve the following game by the principle of dominance.
2 4 3 4
[5 6 3 8 ]
6 7 9 7
12. Solve the following game by the principle of dominance.
 8 10 9 14
[10 11 8 12 ]
13 12 14 13
13. Solve the game using probability method, whose pay off matrix is given by
1 7 2
[6 2 7 ]
5 1 6
14. Solve the game using probability method, whose pay off matrix is given by
6 −3 7
[ ]
−3 0 4
15. Solve the game using probability method, whose pay off matrix is given by
−2 −1
[ ]
2 −3
16. Solve the game using probability method, whose pay off matrix is given by
3 5
[ ]
4 1
17. Solve the game using probability method, whose pay off matrix is given by
8 −3
[ ]
−3 1
18. Solve the game using probability method, whose pay off matrix is given by
−1 −3
[ ]
−4 −1
19. Solve the game using probability method, whose pay off matrix is given by
−2 5
[ ]
7 −6
20. Solve the game using probability method, whose pay off matrix is given by
−2 5
[ ]
1 −4
21. Solve the following game problem graphically.
player B
2 −4 6 −3 5
player A[ ]
−3 4 −4 1 0
22. Solve the following game problem graphically.
player B
6 3 −10 −3
player A[ ]
3 2 −42 −1
23. Solve the following game problem graphically.
player B
3 −3 4
player A[ ]
−1 1 −3
24. Solve the following game problem graphically.
player B
1 3 11
player A[ ]
8 5 2
25. Solve the following game problem graphically.
player B
1 4 −2−3
player A[ ]
2 1 4 5
26. Solve the following game problem graphically.
player B
8 5 −7 9
player A[ ]
−6 6 4 −2
27. Solve the following game problem graphically.
player B
2 1 0−2
player A[ ]
1 0 32
1 −3
3 5
−1 6
28. Solve the following game problem graphically.
4 1
2 2
[−5 0]
1 2
5 4
29. Solve the following game problem graphically. −7 9
−4 −3
[ 2 1 ]
−2 5
−5 3
30. Solve the following game problem graphically. 0 −2
−3 0
[1 −4]