Open Access
Full Length Paper Series A

Mathematical Programming

, Volume 141, Issue 1, pp 193-215

Computing pure Nash and strong equilibria in bottleneck congestion games

Authors

  • Tobias Harks
    • School of Business and EconomicsMaastricht University
  • Martin Hoefer
    • Department of Computer ScienceRWTH Aachen University
  • Max Klimm
    • Department of MathematicsTU Berlin
  • Alexander Skopalik
    • TU Dortmund

DOI: 10.1007/s10107-012-0521-3

Abstract

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria—a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute strong equilibria, which has polynomial running time for many interesting classes of games such as, e.g., matroid or single-commodity bottleneck congestion games. In addition, we examine the more demanding goal to reach equilibria in polynomial time using natural improvement dynamics. Using unilateral improvement dynamics in matroid games pure Nash equilibria can be reached efficiently. In contrast, computing even a single coalitional improvement move in matroid and single-commodity games is strongly NP-hard. In addition, we establish a variety of hardness results and lower bounds regarding the duration of unilateral and coalitional improvement dynamics. They continue to hold even for convergence to approximate equilibria.

Keywords

Bottleneck congestion games Computation of strong equilibria Improvement dynamics

Mathematics Subject Classification

91A10 Noncooperative games 91A46 Combinatorial games 91-08 Computational methods 90B18 Communication networks

Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.

Copyright information

© The Author(s) 2012