Under the auspices of the Computational Complexity Foundation (CCF)
We prove that computing a Nash equilibrium in a 3-playergame is PPAD-complete, solving a problem left open in our recent result on the complexity of Nash equilibria.
