On the Performance of Approximate Equilibria in Congestion Games

We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the price of stability improves as a function of the approximation factor . We give almost tight upper and lower bounds for both the price of anarchy and the price of stability for atomic and non-atomic congestion games. Our results not only encompass and generalize the existing results of exact equilibria to -Nash equilibria, but they also provide a unified approach which reveals the common threads of the atomic and non-atomic price of anarchy results. By expanding the spectrum, we also cast the existing results in a new light.

• Type: Conference
• Year: 2009
• Where: ESA
• Authors: George Christodoulou, Elias Koutsoupias, Paul G. Spirakis
• Keywords: Algorithms, Anarchy, Approximate Nash Equilibria, Congestion Games, ESA 2009