Proof — PPAD-completeness of Nash
Statement
Computational complexity of Nash equilibrium; market equilibria. Proved in ZFC.
Source
IMU Abacus Medal 2018. Computational complexity of Nash equilibrium; market equilibria. Proved in ZFC.
Domains
computer-science