Year: 2026
Type: preprint
Abstract: We show that computing a Nash equilibrium is CLS-complete for linear network congestion and network coordination games. As a result, finding a KKT point of a bilinear polynomial is CLS-complete.
Source: arXiv (Cornell University)
Institutions: Carnegie Mellon University, University of California, Irvine
Language: English
Topic: Game Theory and Applications
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W7214726545
