This document discusses using the graphical method to solve game theory problems with two strategies. It provides algorithms for solving 2xN and Mx2 payoff matrices by drawing lines between payoff points and finding the maximin or minimax point. This determines the optimal 2x2 subgame and solution. Two examples are shown for each type of matrix game and solved graphically.
This document discusses using the graphical method to solve game theory problems with two strategies. It provides algorithms for solving 2xN and Mx2 payoff matrices by drawing lines between payoff points and finding the maximin or minimax point. This determines the optimal 2x2 subgame and solution. Two examples are shown for each type of matrix game and solved graphically.
This document discusses using the graphical method to solve game theory problems with two strategies. It provides algorithms for solving 2xN and Mx2 payoff matrices by drawing lines between payoff points and finding the maximin or minimax point. This determines the optimal 2x2 subgame and solution. Two examples are shown for each type of matrix game and solved graphically.
This document discusses using the graphical method to solve game theory problems with two strategies. It provides algorithms for solving 2xN and Mx2 payoff matrices by drawing lines between payoff points and finding the maximin or minimax point. This determines the optimal 2x2 subgame and solution. Two examples are shown for each type of matrix game and solved graphically.
The graphical method is used to solve the games whose payoff matrix has Two rows and n columns (2 x n) m rows and two columns (m x 2) Algorithm for solving 2 x n matrix games Draw two vertical axes 1 unit apart. The two lines are x1 = 0, x1 = 1 Take the points of the first row in the payoff matrix on the vertical line x 1 = 1 and the points of the second row in the payoff matrix on the vertical line x 1 = 0. The point a1j on axis x1 = 1 is then joined to the point a2j on the axis x1 = 0 to give a straight line. Draw ‘n’ straight lines for j=1, 2… n and determine the highest point of the lower envelope obtained. This will be the maximin point. The two or more lines passing through the maximin point determines the required 2 x 2 payoff matrix. This in turn gives the optimum solution by making use of analytical method. Example 1 Solve by graphical method
Solution
Prepared by: Mr. R A Khan, Visiting Faculty Page 1
V = 66/13 SA = (4/13, 9 /13) SB = (0, 10/13, 3 /13) Example 2 Solve by graphical method
Solution
Prepared by: Mr. R A Khan, Visiting Faculty Page 2
V = 8/7 SA = (3/7, 4 /7) SB = (2/7, 0, 5 /7)
Algorithm for solving m x 2 matrix games
Draw two vertical axes 1 unit apart. The two lines are x1 =0, x1 = 1 Take the points of the first row in the payoff matrix on the vertical line x 1 = 1 and the points of the second row in the payoff matrix on the vertical line x 1 = 0. The point a1j on axis x1 = 1 is then joined to the point a2j on the axis x1 = 0 to give a straight line. Draw ‘n’ straight lines for j=1, 2… n and determine the lowest point of the upper envelope obtained. This will be the minimax point. The two or more lines passing through the minimax point determines the required 2 x 2 payoff matrix. This in turn gives the optimum solution by making use of analytical method.
Example 1 Solve by graphical method
Solution
Prepared by: Mr. R A Khan, Visiting Faculty Page 3
V = 3/9 = 1/3 SA = (0, 5 /9, 4/9, 0) SB = (3/9, 6 /9)
Example 2
Solve by graphical method
Prepared by: Mr. R A Khan, Visiting Faculty Page 4
Solution
Prepared by: Mr. R A Khan, Visiting Faculty Page 5
V = 73/17 SA = (0, 16/17, 1/17, 0, 0) SB = (5/17, 12 /17)
Prepared by: Mr. R A Khan, Visiting Faculty Page 6
