Algorithmic Game Theory (Lecture 19: Pure Nash Equilibria and PLS-Completeness)
Tim Roughgarden Lectures · 72:59
This lecture develops PLS-completeness as the local-search analog of NP-completeness, then uses it to explain why computing a pure Nash equilibrium of a general (asymmetric) congestion game has no known polynomial-tim...