{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T01:18:59Z","timestamp":1771377539795,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T00:00:00Z","timestamp":1650931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T00:00:00Z","timestamp":1650931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10107-022-01803-w","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T13:12:38Z","timestamp":1650978758000},"page":"499-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The price of Anarchy in series-parallel network congestion games"],"prefix":"10.1007","volume":"203","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3356-6444","authenticated-orcid":false,"given":"Bainian","family":"Hao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-816X","authenticated-orcid":false,"given":"Carla","family":"Michini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,26]]},"reference":[{"issue":"6","key":"1803_CR1","doi-asserted-by":"publisher","first-page":"25: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-25:22 (2008)","journal-title":"J. ACM"},{"key":"1803_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"issue":"4","key":"1803_CR3","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"1803_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201905, pp. 57\u201366. Association for Computing Machinery, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"1","key":"1803_CR5","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/070702370","volume":"42","author":"B Awerbuch","year":"2013","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. SIAM J. Comput. 42(1), 160\u2013177 (2013)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1803_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M Bern","year":"1987","unstructured":"Bern, M., Lawler, E., Wong, A.: Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8(2), 216\u2013235 (1987)","journal-title":"J. Algorithms"},{"key":"1803_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-13036-6_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"U Bhaskar","year":"2010","unstructured":"Bhaskar, U., Fleischer, L., Huang, C.: The price of collusion in series-parallel networks. In: Eisenbrand, F., Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization, pp. 313\u2013326. Springer, Berlin (2010)"},{"key":"1803_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.tcs.2019.10.012","volume":"806","author":"V Bil\u00f2","year":"2020","unstructured":"Bil\u00f2, V., Vinci, C.: The price of anarchy of affine congestion games with similar strategies. Theor. Comput. Sci. 806, 641\u2013654 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"1803_CR9","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201905, pp. 67\u201373. Association for Computing Machinery, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"4","key":"1803_CR10","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1287\/moor.2018.0968","volume":"44","author":"J Correa","year":"2019","unstructured":"Correa, J., de Jong, J., de Keijzer, B., Uetz, M.: The inefficiency of Nash and subgame perfect equilibria for network routing. Math. Oper. Res. 44(4), 1286\u20131303 (2019)","journal-title":"Math. Oper. Res."},{"key":"1803_CR11","first-page":"2004","volume":"29","author":"JR Correa","year":"2003","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29, 2004 (2003)","journal-title":"Math. Oper. Res."},{"key":"1803_CR12","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: On the inefficiency of equilibria in congestion games. In: Integer Programming and Combinatorial Optimization, pp. 167\u2013181. Springer, Berlin (2005)","DOI":"10.1007\/11496915_13"},{"issue":"1","key":"1803_CR13","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(1), 115\u2013125 (2009)","journal-title":"Games Econ. Behav."},{"key":"1803_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of STOC \u201904 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"1803_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00224-009-9205-7","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. Theory Comput. Syst. 47, 113\u2013136 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9205-7","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"1803_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1287\/trsc.22.1.39","volume":"22","author":"PT Harker","year":"1988","unstructured":"Harker, P.T.: Multiple equilibrium behaviors on networks. Transp. Sci. 22(1), 39\u201346 (1988)","journal-title":"Transp. Sci."},{"key":"1803_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00182-014-0448-4","volume":"44","author":"R Holzman","year":"2015","unstructured":"Holzman, R., Monderer, D.: Strong equilibrium in network congestion games: increasing versus decreasing costs. Int. J. Game Theory 44, 647\u2013666 (2015)","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"1803_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"1803_CR19","doi-asserted-by":"crossref","unstructured":"de\u00a0Jong, J., Klimm, M., Uetz, M.: Efficiency of equilibria in uniform matroid congestion games. In: Martin\u00a0Gairing, R.S. (ed.) 9th International Symposium on Algorithmic Game Theorey (SAGT). Lecture Notes in Computer Science, vol. 9928, pp. 105\u2013116. Springer, Berlin (2016)","DOI":"10.1007\/978-3-662-53354-3_9"},{"issue":"3","key":"1803_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","volume":"5","author":"T Kikuno","year":"1983","unstructured":"Kikuno, T., Yoshida, N., Kakuda, Y.: A linear algorithm for the domination number of a series-parallel graph. Discrete Appl. Math. 5(3), 299\u2013311 (1983)","journal-title":"Discrete Appl. Math."},{"key":"1803_CR21","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS 99, pp. 404\u2013413. Springer, Berlin (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"2","key":"1803_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.disopt.2013.01.001","volume":"10","author":"SO Krumke","year":"2013","unstructured":"Krumke, S.O., Zeck, C.: Generalized max flow in series-parallel graphs. Discrete Optim. 10(2), 155\u2013162 (2013)","journal-title":"Discrete Optim."},{"issue":"2","key":"1803_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"1803_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"1803_CR25","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE\/ACM Trans. Netw. 1(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"1803_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/moor.23.1.69","volume":"23","author":"T Radzik","year":"1998","unstructured":"Radzik, T.: Faster algorithms for the generalized network flow problem. Math. Oper. Res. 23(1), 69\u2013100 (1998)","journal-title":"Math. Oper. Res."},{"key":"1803_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"1803_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3(1), 53\u201359 (1973)","journal-title":"Networks"},{"key":"1803_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2), 341\u2013364 (2003). Special Issue on STOC 2002","DOI":"10.1016\/S0022-0000(03)00044-8"},{"key":"1803_CR30","unstructured":"Roughgarden, T.: Selfish routing with atomic players. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201905, pp. 1184\u20131185. Society for Industrial and Applied Mathematics, USA (2005)"},{"issue":"2","key":"1803_CR31","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"3","key":"1803_CR32","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3), 623\u2013641 (1982)","journal-title":"J. ACM"},{"issue":"2","key":"1803_CR33","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R., Lawler, E.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01803-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01803-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01803-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:01:12Z","timestamp":1727049672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01803-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,26]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1803"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01803-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,26]]},"assertion":[{"value":"31 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}