Tree Polymatrix Games are PPAD-hard

We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with twenty actions per player. This is the first PPAD hardness result for a game with a constant number of actions per player where the interaction graph is acyclic. Along the way we show PPAD-hardness for finding an $\epsilon$-fixed point of a 2D LinearFIXP instance, when $\epsilon$ is any constant less than $(\sqrt{2} - 1)/2 \approx 0.2071$. This lifts the hardness regime from polynomially small approximations in $k$-dimensions to constant approximations in two-dimensions, and our constant is substantial when compared to the trivial upper bound of $0.5$.

[1]  Paul G. Spirakis,et al.  Computing Approximate Nash Equilibria in Polymatrix Games , 2015, Algorithmica.

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

[3]  Yang Cai,et al.  On minmax theorems for multiplayer games , 2011, SODA '11.

[4]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[5]  Aviad Rubinstein,et al.  Inapproximability of Nash Equilibrium , 2014, STOC.

[6]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[7]  Xi Chen,et al.  On the complexity of 2D discrete fixed point problem , 2006, Theor. Comput. Sci..

[8]  John Fearnley,et al.  Computing Constrained Approximate Equilibria in Polymatrix Games , 2017, SAGT.

[9]  Ruta Mehta,et al.  Constant Rank Two-Player Games are PPAD-hard , 2018, SIAM J. Comput..

[10]  Luis E. Ortiz,et al.  Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure , 2017, AAAI.

[11]  John Fearnley,et al.  An Empirical Study on Computing Equilibria in Polymatrix Games , 2016, AAMAS.

[12]  Georgios Piliouras,et al.  Approximating Nash Equilibria in Tree Polymatrix Games , 2015, SAGT.

[13]  Edith Elkind,et al.  Nash equilibria in graphical games on trees revisited , 2006, EC '06.

[14]  Aviad Rubinstein,et al.  Settling the Complexity of Computing Approximate Two-Player Nash Equilibria , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[16]  Michael L. Littman,et al.  An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games , 2001, NIPS.