Question: Since every two-person zero sum game can be formulated as a bimatrix game, show how to modify the Lemke-Howson algorithm to be able to calculate saddle points of zero sum two-person games. Then use that to find the value and saddle point for the game with matrix
Check your answer by using the linear programming method to solve this game.