2012/03/07 by Tobias Harks, Martin Hoefer, Max Klimm +1 · 2 citations
Decision Sciences · Economics, Econometrics and Finance · Mathematics · Physics and Astronomy · #Best response #Bottleneck #Combinatorics #Computer science #Convergence (economics) #Economics #Game Theory and Applications #Game Theory and Voting Systems #Mathematical economics #Mathematical optimization #Mathematics #Matroid #Nash equilibrium #Opinion Dynamics and Social Influence #Time complexity
paper · pdf · doi:10.1007/s10107-012-0521-3
openalex publication_date 2012/03/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
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.