2000 character limit reached
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form (1408.1017v1)
Published 5 Aug 2014 in cs.GT and cs.CC
Abstract: We consider the task of computing an approximation of a trembling hand perfect equilibrium for an n-player game in strategic form, n >= 3. We show that this task is complete for the complexity class FIXP_a. In particular, the task is polynomial time equivalent to the task of computing an approximation of a Nash equilibrium in strategic form games with three (or more) players.