Numerical search for equilibria in bimatrix games

Numerical search for Nash equilibria in a bimatrix game is analyzed by applying the variational approach. To solve an associated nonconvex mathematical programming problem, a modified global search algorithm is proposed that is based on global optimality conditions for this problem. The efficiency of the algorithm is demonstrated by numerical results.