Work

The Complexity of Nash Equilibrium in Network Congestion and Coordination Games

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.
Language: English
Open Access status: green
OpenAlex ID: W7214726545
Cites: 1
Cited by: 1
Related to: 9