An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria

We focus on the problem of computing approximate Nash equilibria in bimatrix games. In particular, we consider the notion of approximate well-supported equilibria, which is one of the standard approaches for approximating equilibria. It is already known that one can compute an epsilon-well-supported Nash equilibrium in time n(O(log n/epsilon 2)), for any epsilon > 0, in games with n pure strategies per player. Such a running time is referred to as quasi-polynomial. Regarding faster algorithms, it has remained an open problem for many years if we can have better running times for small values of the approximation parameter, and it is only known that we can compute in polynomial-time a 0:6528 -well-supported Nash equilibrium. In this paper, we investigate further this question and propose a much better quasi-polynomial time algorithm that computes a (1/2 + epsilon)-well-supported Nash equilibrium in time n(O(log log n1/epsilon/epsilon 2)), for any epsilon > 0. Our algorithm is based on appropriately combining sampling arguments, support enumeration, and solutions to systems of linear inequalities.