Key points are not available for this paper at this time.
The purpose of this note is to describe a method for computing the extreme equilibrium points of a bimatrix game which are finite in number. This in essence determines all equilibrium points of the game, The present method seems to be simpler than that of Vorob’ev’s method 7 and Kuhn’s simplification thereof 3. A computer program has been written to implement the present method.
O. L. Mangasarian (Tue,) studied this question.