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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ackermann, H., Berenbrink, P., Fischer, S., Hoefer, M.: Concurrent imitation dynamics in congestion games. In: Proceedings of the 28th Symposium Principles of Distributed Computing (PODC), pp. 63–72 (2009)
Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1–25:22 (2008)
Albers S.: On the value of coordination in network design. SIAM J. Comput. 38(6), 2273–2302 (2009)
Andelman N., Feldman M., Mansour Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289–317 (2009)
Aumann, R.: Acceptable points in general cooperative n-person games. In: Proceedings of the Contributions to the Theory of Games IV, vol. 40 of Annals of Mathematics Study, pp. 287–324. Princeton University Press, Princeton (1959)
Banner R., Orda A.: Bottleneck routing games in communication networks. IEEE J. Sel. Area Comm. 25(6), 1173–1179 (2007)
Bérczi, K., Frank, A.: Packing arborescences. Technical Report TR-2009-04, Egerváry Research Group on Combinatorial Optimization (2009)
Bhalgat, A., Chakraborty, T., Khanna, S.: Nash dynamics in congestion games with similar resources. In: Proceedings of the 5th International Workshop Internet & Network Economics (WINE), pp. 362–373 (2009)
Busch C., Magdon-Ismail M.: Atomic routing games on maximum congestion. Theoret. Comput. Sci. 410(36), 3337–3975 (2009)
Chakraborty, T., Khanna, S.: Nash dynamics in constant player and bounded jump congestion games. In: Proceedings of the 2nd International Symposium Algorithmic Game Theory (SAGT), pp. 196–207 (2009)
Chien S., Sinclair A.: Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71(2), 315–327 (2011)
Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proceedings of the 17th Symposium Discrete Algorithms (SODA), pp. 668–677 (2006)
Cunningham W.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948–957 (1986)
de Keijzer, B., Schäfer, G., Telelis, O.: On the inefficiency of equilibria in linear bottleneck congestion games. In: Proceedings of the 3rd International Symposium Algorithmic Game Theory (SAGT), pp. 335–346 (2010)
Edmonds J.: Matroid partition. In: Dantzig, G.B., Veinott, A.F. (eds) Mathematics of the Decision Sciences, pp. 335–345. AMS, Providence, RI (1968)
Epstein A., Feldman M., Mansour Y.: Efficient graph topologies in network routing games. Games Econ. Behav. 66, 115–125 (2009)
Epstein A., Feldman M., Mansour Y.: Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1), 51–68 (2009)
Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Symposium Theory of Computing (STOC), pp. 604–612 (2004)
Feldman M., Tamir T.: Approximate strong equilibrium in job scheduling games. J. Artif. Intell. Res. 36, 387–414 (2009)
Feldman M., Tennenholtz M.: Structured coalitions in resource selection games. ACM Trans. Intell. Syst. Tech. 1(1), 4 (2010)
Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong price of anarchy for machine load balancing. In: Proceedings of the 34th Intl. Coll. Automata, Languages and Programming (ICALP), pp. 583–594 (2007)
Fortune S., Hopcroft J., Wyllie J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111–121 (1980)
Gabow H.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259–273 (1995)
Gairing M., Monien B., Tiemann K.: Routing (un-)splittable flow in games with player-specific linear latency functions. ACM Trans. Algorithms 7(3), 31 (2011)
Harks, T., Klimm, M., Möhring, R.: Strong Nash equilibria in games with the lexicographical improvement property. In: Proceedings of the 5th International Workshop Internet & Network Economics (WINE), pp. 463–470 (2009)
Hoefer, M., Penn, M., Polukarov, M., Skopalik, A., Vöcking, B.: Considerate equilibrium. In: Proceedings of the 22nd International Joint Conference Artificial Intelligence (IJCAI), pp. 234–239 (2011)
Hoefer, M., Skopalik, A.: On the complexity of Pareto-optimal Nash and strong equilibria. In: Proceedings of the 3rd International Symposium Algorithmic Game Theory (SAGT), pp. 312–322 (2010)
Holzman R., Law-Yone N.: Strong equilibrium in congestion games. Games Econ. Behav. 21(1–2), 85–101 (1997)
Johnson D., Papadimitriou C., Yannakakis M.: How easy is local search?. J. Comput. Syst. Sci. 37, 79–100 (1988)
Kannan, R., Busch, C.: Bottleneck congestion games with logarithmic price of anarchy. In: Proceedings of the 3rd International Symposium Algorithmic Game Theory (SAGT), pp. 222–233 (2010)
Keshav S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, Boston, MA (1997)
Konishi H., Breton M.L., Weber S.: Equilibria in a model with partial rivalry. J. Econ. Theory 72(1), 225–237 (1997)
Korte B., Vygen J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2002)
Leonardi, S., Sankowski, P.: Network formation games with local coalitions. In: Proceedings of the 26th Symposium Principles of Distributed Computing (PODC), pp. 299–305 (2007)
Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion games with player-specific constants. In: Proceedings of the 32nd International Symposium Mathematical Foundations of Computer Science (MFCS), pp. 633–644 (2007)
Mazalov, V., Monien, B., Schoppmann, F., Tiemann, K.: Wardrop equilibria and price of stability for bottleneck games with splittable traffic. In: Proceedings of the 2nd International Workshop Internet & Network Economics (WINE), pp. 331–342 (2006)
Milchtaich I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13(1), 111–124 (1996)
Monderer, D., Shapley, L.: Potential games. Games Econom. Behav. 14, 1124–1143 (1996)
Nash-Williams, C.: An application of matroids to graph theory. In: Rosenstiehl, P. (ed.) Theory of Graphs; Proceedings of an International Symposium in Rome 1966, pp. 263–265 (1967)
Qiu L., Yang Y.R., Zhang Y., Shenker S.: On selfish routing in internet-like environments. IEEE/ACM Trans. Netw. 14(4), 725–738 (2006)
Rosenthal R.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65–67 (1973)
Roughgarden T.: Routing games. In: Nisan, N., Tardos, É., Roughgarden, T., Vazirani, V. (eds) Algorithmic Game Theory Chapter 18, Cambridge University Press, Cambridge (2007)
Rozenfeld, O., Tennenholtz, M.: Strong and correlated strong equilibria in monotone congestion games. In: Proceedings of the 2nd International Workshop Internet & Network Economics (WINE), pp. 74–86 (2006)
Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
Skopalik, A., Vöcking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 40th Symposium Theory of Computing (STOC), pp. 355–364 (2008)
Syrgkanis, V.: Equilibria in congestion game models: Existence, complexity and efficiency. Master’s thesis, National Technical University of Athens (2009)
Voorneveld M., Borm P., van Megen F., Tijs S., Facchini G.: Congestion games and potentials reconsidered. Int. Game Theory Rev. 1(3), 283–299 (1999)
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
An extended abstract of this paper appeared in the Proceedings of the 18th Annual European Symposium on Algorithms (ESA).
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Harks, T., Hoefer, M., Klimm, M. et al. Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141, 193–215 (2013). https://doi.org/10.1007/s10107-012-0521-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-012-0521-3