there exists R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria
ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2018.
Nash equilibriumsymmetric gamesdecision problemsexistential theory of realsFIXP
As a result of a series of important works [7-9, 15, 23], the complexity of two-player Nash equilibrium is by now well understood, even when equilibria with special properties are desired and when the game is symmetric. However, for multi-player games, when equilibria with special properties are desired, the only result known is due to Sc...More
Full Text (Upload PDF)
PPT (Upload PPT)