# Well-Supported versus Approximate Nash Equilibria: Query Complexity of Large Games

ITCS, 2017.

EI

Abstract:

We study the randomized query complexity of approximate Nash equilibria (ANE) in large games. We prove that, for some constant $\epsilon>0$, any randomized oracle algorithm that computes an $\epsilon$-ANE in a binary-action, $n$-player game must make $2^{\Omega(n/\log n)}$ payoff queries. For the stronger solution concept of well-suppor...More

Code:

Data: