The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form

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.

[1]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[2]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[3]  R. Anderson.  “Almost” implies “near” , 1986 .

[4]  Troels Bjerre Sørensen.  Computing a proper equilibrium of a bimatrix game , 2012, EC '12.

[5]  Peter Bro Miltersen,et al.  Computing a quasi-perfect equilibrium of a two-player game , 2010 .

[6]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[7]  Christos H. Papadimitriou,et al.  On graph-theoretic lemmata and complexity classes , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Takuya Kon-no,et al.  Transactions of the American Mathematical Society , 1996 .

[9]  Kristoffer Arnsfelt Hansen,et al.  The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements , 2010, SAGT.

[10]  Herbert E. Scarf,et al.  The Approximation of Fixed Points of a Continuous Mapping , 1967 .

[11]  R. Selten.  Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.

[12]  Ennio Stacchetti,et al.  A Bound on the Proportion of Pure Strategy Equilibria in Generic Games , 1993, Math. Oper. Res..

[13]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[14]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[17]  Bernhard von Stengel,et al.  Computing Normal Form Perfect Equilibria for Extensive Two-Person Games , 2002 .

[18]  E. Vandamme.  Stability and perfection of nash equilibria , 1987 .

[19]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..