OpenAlex ·
The Complexity of Nash Equilibrium in Network Congestion and Coordination Games
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.33225
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
AI-based matching improves refugee employment in a double-blind randomized trial
On best of both worlds allocations with subadditive valuations
Representation Risk in Pretrained Image Encoders
PriceBench: A Diagnostic Benchmark for Price, Quality, and Brand Preferences in LLM Booking Agents
Fluctuations and multifractality in stochastic models of interface growth and population dynamics
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.