The Complexity of Pure Nash Equilibria

The Complexity of Pure Nash Equilibria (2004)

by Alex Fabrikant , Christos Papadimitriou , Kunal Talwar

Citations:

113 - 6 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Complexity of Pure Nash Equilibria	user correction - Legacy Corrections
AUTHOR NAME	Alex Fabrikant	SVM HeaderParse 0.1
AUTHOR NAME	Christos Papadimitriou	SVM HeaderParse 0.1
AUTHOR NAME	Kunal Talwar	SVM HeaderParse 0.1
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 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.	user correction - Legacy Corrections
YEAR	2004	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	604--612	INFERENCE
CITATIONS	20 found	ParsCit 1.0