Proof — PPAD-completeness
Statement
Complexity of Nash equilibrium; algorithmic game theory. Proved in ZFC.
Source
Donald E. Knuth Prize 2002. Complexity of Nash equilibrium; algorithmic game theory. Proved in ZFC.
Domains
computer-science
Complexity of Nash equilibrium; algorithmic game theory. Proved in ZFC.
Donald E. Knuth Prize 2002. Complexity of Nash equilibrium; algorithmic game theory. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/proof/papadimitriou-knuth-2002/