Bimatrix Game

The bimat.m solves a bimatrix game represented by two matrices M and N .

The code is written to find one mixed Nash equilibrium strategy apart from all pure Nash equilibria in a bimatrix or general sum two person matrix game. It is based upon the algorithm presented by O.L. Mangasarian in 1964. It uses quadprog to solve a quadratic programming problem for a two person matrix game. For details of the algorithm one can see:- Mangasarian O. L., Stone H., Two-Person Nonzero-Sum Games and Quadratic Programming, Journal of Mathematical Analysis and Applications, 9, p.p. 348-355, 1964.