Location of Repository

Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games

By Tim Roughgarden

Abstract

We resolve the worst-case price of anarchy (POA) of atomic splittable congestion games. Prior to this work, no tight bounds on the POA in such games were known, even for the simplest non-trivial special case of affine cost functions. We make two distinct contributions. On the upperbound side, we define the framework of “local smoothness”, which refines the standard smoothness framework for games with convex strategy sets. While standard smoothness arguments cannot establish tight bounds on the POA in atomic splittable congestion games, we prove that local smoothness arguments can. Further, we prove that every POA bound derived via local smoothness applies automatically to every correlated equilibrium of the game. Unlike standard smoothness arguments, bounds proved using local smoothness do not always apply to the coarse correlated equilibria of the game. Our second contribution is a very general lower bound: for every set L that satisfies mild technical conditions, the worst-case POA of pure Nash equilibria in atomic splittable congestion games with cost functions in L is exactly the smallest upper bound provable using local smoothness arguments. In particular, the worstcase POA of pure Nash equilibria, mixed Nash equilibria, and correlated equilibria coincide in such games.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.193.9954
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.siam.org/proceeding... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.