Restoring Pure Equilibria to Weighted Congestion Games
Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the existence of and convergence of natural dynamics to a pure Nash equilibrium. Weighted variants of congestion games that rely on sharing costs proportional to players’ weights do not generally have pure-strategy Nash equilibria. We propose a new way of assigning costs to players with weights in congestion games that recovers the important properties of the unweighted model. This method is derived from the Shapley value, and it always induces a game with a (weighted) potential function. For the special cases of weighted network cost-sharing and atomic selfish routing games (with Shapley value-based cost shares), we prove tight bounds on the price of stability and price of anarchy, respectively.
Keywordscongestion games network design Shapley value
Unable to display preview. Download preview PDF.
- 3.Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC, pp. 57–66 (2005)Google Scholar
- 9.Goemans, M.X., Mirrokni, V., Vetta, A.: Sink equilibria and convergence. In: FOCS, pp. 142–151 (2005)Google Scholar
- 21.Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: STOC, pp. 513–522 (2009)Google Scholar
- 23.Shapley, L.S.: Additive and Non-Additive Set Functions. PhD thesis, Department of Mathematics, Princeton University (1953)Google Scholar