Home > Operation Research calculators > Game Theory problem


1. Game Theory
1. Saddle Point
2. Dominance method
3. Oddment method
4. Algebraic method
5. Calculus method
6. Arithmetic method
7. Matrix method
8. 2Xn Games
9. Graphical method
10. LPP method
11. Bimatrix method

7.1 Saddle Point
1. For the game with payoff matrix
Player `B`
`B_1``B_2``B_3`
Player `A``A_1` -1  2  -2 
`A_2` 6  4  -6 
determine the best strategies for players A and B. Also determine the value of game. Is this game saddle point?
7.2 Dominance method
1. Dominance Example
Player `B`
`B_1``B_2``B_3``B_4`
Player `A``A_1` 3  5  4  2 
`A_2` 5  6  2  4 
`A_3` 2  1  4  0 
`A_4` 3  3  5  2 
 
7.3 Algebraic method
1. Find the solution of game using algebraic method for the following pay-off matrix
Player `B`
`B_1``B_2`
Player `A``A_1` 1  7 
`A_2` 6  2 
7.4 Calculus method
1. Find the solution of game using calculus method for the following pay-off matrix
Player `B`
`B_1``B_2`
Player `A``A_1` 1  3 
`A_2` 5  2 
 
7.5 Arithmetic method
1. Find the solution of game using arithmetic method for the following pay-off matrix
Player `B`
`B_1``B_2``B_3`
Player `A``A_1` 10  5  -2 
`A_2` 13  12  15 
`A_3` 16  14  10 
7.6 Matrix method
1. Find the solution of game using matrix method for the following pay-off matrix
Player `B`
`B_1``B_2``B_3`
Player `A``A_1` 1  7  2 
`A_2` 6  2  7 
`A_3` 5  1  6 
 
7.7 2Xn Games
1. Find the solution of game using 2Xn Games method for the following pay-off matrix
Player `B`
`B_1``B_2`
Player `A``A_1` -3  4 
`A_2` -1  1 
`A_3` 7  -2 
7.8 Graphical method
1. Find the solution of game using graphical method method for the following pay-off matrix
Player `B`
`B_1``B_2`
Player `A``A_1` 1  -3 
`A_2` 3  5 
`A_3` -1  6 
`A_4` 4  1 
`A_5` 2  2 
`A_6` -5  0 
 
7.9 LPP method
1. Find the solution of game using linear programming method for the following pay-off matrix
Player `B`
`B_1``B_2``B_3`
Player `A``A_1` 3  -4  2 
`A_2` 1  -7  -3 
`A_3` -2  4  7 
7.10 Bimatrix method
 




Share this solution or page with your friends.
 
 
Copyright © 2026. All rights reserved. Terms, Privacy
 
 

.