Iterative solution of matrix games by the methods of grid variational inequalities

A new approach to the approximate solution of matrix games is proposed. It is based on the reduction of the original problem to a variational inequality of a special form. In particular, this makes it possible to design preconditioned iterative methods, which proved to be effective as a tool for the numerical solution of large and ill-conditioned systems of linear algebraic equations.