Linear solvers for nonlinear games

Abstract

Nash equilibria of two-player games are much easier to compute in practice than those of n -player games, even though the two problems have the same asymptotic complexity. We used a recent constructive reduction to solve general games using a two-player algorithm. However, the reduction increases the game size too much to be practically usable. An open problem is to find a more compact constructive reduction, which might make this approach feasible.