{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:19:41Z","timestamp":1762017581733},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T00:00:00Z","timestamp":1331164800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10107-012-0521-3","type":"journal-article","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T02:41:05Z","timestamp":1331088065000},"page":"193-215","source":"Crossref","is-referenced-by-count":17,"title":["Computing pure Nash and strong equilibria in bottleneck congestion games"],"prefix":"10.1007","volume":"141","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,8]]},"reference":[{"key":"521_CR1","doi-asserted-by":"crossref","unstructured":"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\u201372 (2009)","DOI":"10.1145\/1582716.1582732"},{"issue":"6","key":"521_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H. Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1\u201325:22 (2008)","journal-title":"J. ACM"},{"issue":"6","key":"521_CR3","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S. Albers","year":"2009","unstructured":"Albers S.: On the value of coordination in network design. SIAM J. Comput. 38(6), 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"521_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"Andelman N., Feldman M., Mansour Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"key":"521_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013324. Princeton University Press, Princeton (1959)","DOI":"10.1515\/9781400882168-018"},{"issue":"6","key":"521_CR6","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R. Banner","year":"2007","unstructured":"Banner R., Orda A.: Bottleneck routing games in communication networks. IEEE J. Sel. Area Comm. 25(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Sel. Area Comm."},{"key":"521_CR7","unstructured":"B\u00e9rczi, K., Frank, A.: Packing arborescences. Technical Report TR-2009-04, Egerv\u00e1ry Research Group on Combinatorial Optimization (2009)"},{"key":"521_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013373 (2009)","DOI":"10.1007\/978-3-642-10841-9_33"},{"issue":"36","key":"521_CR9","doi-asserted-by":"publisher","first-page":"3337","DOI":"10.1016\/j.tcs.2009.04.015","volume":"410","author":"C. Busch","year":"2009","unstructured":"Busch C., Magdon-Ismail M.: Atomic routing games on maximum congestion. Theoret. Comput. Sci. 410(36), 3337\u20133975 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"521_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013207 (2009)","DOI":"10.1007\/978-3-642-04645-2_18"},{"issue":"2","key":"521_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S. Chien","year":"2011","unstructured":"Chien S., Sinclair A.: Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econ. Behav."},{"key":"521_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013677 (2006)","DOI":"10.1145\/1109557.1109630"},{"issue":"4","key":"521_CR13","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"W. Cunningham","year":"1986","unstructured":"Cunningham W.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948\u2013957 (1986)","journal-title":"SIAM J. Comput."},{"key":"521_CR14","doi-asserted-by":"crossref","unstructured":"de Keijzer, B., Sch\u00e4fer, 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\u2013346 (2010)","DOI":"10.1007\/978-3-642-16170-4_29"},{"key":"521_CR15","first-page":"335","volume-title":"Mathematics of the Decision Sciences","author":"J. Edmonds","year":"1968","unstructured":"Edmonds J.: Matroid partition. In: Dantzig, G.B., Veinott, A.F. (eds) Mathematics of the Decision Sciences, pp. 335\u2013345. AMS, Providence, RI (1968)"},{"key":"521_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.geb.2008.04.011","volume":"66","author":"A. Epstein","year":"2009","unstructured":"Epstein A., Feldman M., Mansour Y.: Efficient graph topologies in network routing games. Games Econ. Behav. 66, 115\u2013125 (2009)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"521_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.geb.2008.07.002","volume":"67","author":"A. Epstein","year":"2009","unstructured":"Epstein A., Feldman M., Mansour Y.: Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1), 51\u201368 (2009)","journal-title":"Games Econ. Behav."},{"key":"521_CR18","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Symposium Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"521_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1613\/jair.2892","volume":"36","author":"M. Feldman","year":"2009","unstructured":"Feldman M., Tamir T.: Approximate strong equilibrium in job scheduling games. J. Artif. Intell. Res. 36, 387\u2013414 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"521_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1858948.1858952","volume":"1","author":"M. Feldman","year":"2010","unstructured":"Feldman M., Tennenholtz M.: Structured coalitions in resource selection games. ACM Trans. Intell. Syst. Tech. 1(1), 4 (2010)","journal-title":"ACM Trans. Intell. Syst. Tech."},{"key":"521_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013594 (2007)","DOI":"10.1007\/978-3-540-73420-8_51"},{"key":"521_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune S., Hopcroft J., Wyllie J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"521_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H. Gabow","year":"1995","unstructured":"Gabow H.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"521_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1978782.1978786","volume":"7","author":"M. Gairing","year":"2011","unstructured":"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)","journal-title":"ACM Trans. Algorithms"},{"key":"521_CR25","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.: Strong Nash equilibria in games with the lexicographical improvement property. In: Proceedings of the 5th International Workshop Internet & Network Economics (WINE), pp. 463\u2013470 (2009)","DOI":"10.1007\/978-3-642-10841-9_43"},{"key":"521_CR26","unstructured":"Hoefer, M., Penn, M., Polukarov, M., Skopalik, A., V\u00f6cking, B.: Considerate equilibrium. In: Proceedings of the 22nd International Joint Conference Artificial Intelligence (IJCAI), pp. 234\u2013239 (2011)"},{"key":"521_CR27","doi-asserted-by":"crossref","unstructured":"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\u2013322 (2010)","DOI":"10.1007\/978-3-642-16170-4_27"},{"issue":"1\u20132","key":"521_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R. Holzman","year":"1997","unstructured":"Holzman R., Law-Yone N.: Strong equilibrium in congestion games. Games Econ. Behav. 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"key":"521_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. Johnson","year":"1988","unstructured":"Johnson D., Papadimitriou C., Yannakakis M.: How easy is local search?. J. Comput. Syst. Sci. 37, 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"521_CR30","doi-asserted-by":"crossref","unstructured":"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\u2013233 (2010)","DOI":"10.1007\/978-3-642-16170-4_20"},{"key":"521_CR31","volume-title":"An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network","author":"S. Keshav","year":"1997","unstructured":"Keshav S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, Boston, MA (1997)"},{"issue":"1","key":"521_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jeth.1996.2203","volume":"72","author":"H. Konishi","year":"1997","unstructured":"Konishi H., Breton M.L., Weber S.: Equilibria in a model with partial rivalry. J. Econ. Theory 72(1), 225\u2013237 (1997)","journal-title":"J. Econ. Theory"},{"key":"521_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2002","unstructured":"Korte B., Vygen J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2002)"},{"key":"521_CR34","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sankowski, P.: Network formation games with local coalitions. In: Proceedings of the 26th Symposium Principles of Distributed Computing (PODC), pp. 299\u2013305 (2007)","DOI":"10.1145\/1281100.1281143"},{"key":"521_CR35","doi-asserted-by":"crossref","unstructured":"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\u2013644 (2007)","DOI":"10.1007\/978-3-540-74456-6_56"},{"key":"521_CR36","doi-asserted-by":"crossref","unstructured":"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\u2013342 (2006)","DOI":"10.1007\/11944874_30"},{"issue":"1","key":"521_CR37","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"521_CR38","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econom. Behav. 14, 1124\u20131143 (1996)"},{"key":"521_CR39","unstructured":"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\u2013265 (1967)"},{"issue":"4","key":"521_CR40","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TNET.2006.880179","volume":"14","author":"L. Qiu","year":"2006","unstructured":"Qiu L., Yang Y.R., Zhang Y., Shenker S.: On selfish routing in internet-like environments. IEEE\/ACM Trans. Netw. 14(4), 725\u2013738 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"521_CR41","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal R.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"521_CR42","volume-title":"Algorithmic Game Theory Chapter 18","author":"T. Roughgarden","year":"2007","unstructured":"Roughgarden T.: Routing games. In: Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds) Algorithmic Game Theory Chapter 18, Cambridge University Press, Cambridge (2007)"},{"key":"521_CR43","doi-asserted-by":"crossref","unstructured":"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\u201386 (2006)","DOI":"10.1007\/11944874_8"},{"key":"521_CR44","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"521_CR45","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 40th Symposium Theory of Computing (STOC), pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"521_CR46","unstructured":"Syrgkanis, V.: Equilibria in congestion game models: Existence, complexity and efficiency. Master\u2019s thesis, National Technical University of Athens (2009)"},{"issue":"3","key":"521_CR47","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S0219198999000219","volume":"1","author":"M. Voorneveld","year":"1999","unstructured":"Voorneveld M., Borm P., van Megen F., Tijs S., Facchini G.: Congestion games and potentials reconsidered. Int. Game Theory Rev. 1(3), 283\u2013299 (1999)","journal-title":"Int. Game Theory Rev."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0521-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0521-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0521-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0521-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T01:24:32Z","timestamp":1561425872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0521-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,8]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["521"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0521-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,8]]}}}