17 citations · 38 across the 18 of their papers we have counts for
1 paper · 1 filter
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
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…