Abstract:We investigate from the computational viewpoint multi-player games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed...We investigate from the computational viewpoint multi-player games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLS-complete in general. We discuss implications to non-atomic congestion games, and we explore the scope of the potential function method for proving existence of pure Nash equilibria.Read More
Publication Year: 2004
Publication Date: 2004-06-13
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 679
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot