  We show that the problem of finding an {\epsilon}-approximate Nash
equilibrium in an anonymous game with seven pure strategies is complete in
PPAD, when the approximation parameter {\epsilon} is exponentially small in the
number of players.
