Title
Atomic selfish routing in networks: a survey
Abstract
In this survey we present some recent advances in the literature of atomic (mainly network) congestion games. The algorithmic questions that we are interested in have to do with the existence of pure Nash equilibria, the efficiency of their construction when they exist, as well as the gap of the best/worst (mixed in general) Nash equilibria from the social optima in such games, typically called the Price of Anarchy and the Price of Stability respectively.
Year
DOI
Venue
2005
10.1007/11600930_100
WINE
Keywords
Field
DocType
nash equilibria,network congestion,price of anarchy,price of stability
Mathematical economics,Mathematical optimization,Congestion game,Algorithmics,Computer science,Price of stability,Best response,Game theory,Price of anarchy,Nash equilibrium,Traffic congestion
Conference
Volume
ISSN
ISBN
3828
0302-9743
3-540-30900-4
Citations 
PageRank 
References 
13
0.70
25
Authors
2
Name
Order
Citations
PageRank
Spyros Kontogiannis125928.04
Paul G. Spirakis22222299.05