MathDB1 problem
- 0 votes0 replies0 views
The conjecture that computing Nash equilibria requires superpolynomial time
Computational hardness conjecture. There is no polynomial-time algorithm for computing Nash equilibria.
The conjecture that computing Nash equilibria requires superpolynomial time
Computational hardness conjecture. There is no polynomial-time algorithm for computing Nash equilibria.