Computational Complexity of Approximate Nash Equilibrium in Large Games
Computer Science and Game Theory
2014-05-20 v3
Abstract
We prove that finding an epsilon-Nash equilibrium in a succinctly representable game with many players is PPAD-hard for constant epsilon. Our proof uses succinct games, i.e. games whose payoff function is represented by a circuit. Our techniques build on a recent query complexity lower bound by Babichenko.
Keywords
Cite
@article{arxiv.1405.0524,
title = {Computational Complexity of Approximate Nash Equilibrium in Large Games},
author = {Aviad Rubinstein},
journal= {arXiv preprint arXiv:1405.0524},
year = {2014}
}
Comments
New version includes an addendum about subsequent work on the open problems proposed