Nikolai Sokolov

Evgeny Golshtein

Ustav Malkov

We propose a method for solving bimatrix games based on a search of a global minimum of the Nash function. Choosing one by one some initial pure strategies, the method finds an exact solution of the game, if the complementarity condition holds, or it gives an acceptable approaching to the set of Nash points. The numerical tests of the method identified its advantages and disadvantages.