Seeking the equilibrium situations in bimatrix games

Determination of the Nash-equilibria in the bimatrix game was considered by reducing it to its equivalent nonconvex problem of optimization solved by the algorithm of global search based on the theory of global extremum for this problem. Efficiency of this method was illustrated by numerical solution of bimatrix games of sufficiently high dimensions.

Presented by the member of Editorial Board: A. I. Kibzun