{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:12:22Z","timestamp":1743070342792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031228315"},{"type":"electronic","value":"9783031228322"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_1","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Inefficiency of Pure Nash Equilibria in Series-Parallel Network Congestion Games"],"prefix":"10.1007","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,12,9]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 218\u2013229. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_17"},{"key":"1_CR2","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, pp. 57\u201366. STOC 2005, Association for Computing Machinery, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"1","key":"1_CR3","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":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: the price of anarchy, universal worst-case examples, and tightness. ACM Trans. Econ. Comput. 2(4), 1\u201323 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"1_CR5","unstructured":"Bil\u00f2, V., Vinci, C.: On the impact of singleton strategies in congestion games. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 17:1\u201317:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica 61(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"1_CR7","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, pp. 67\u201373. STOC 2005, Association for Computing Machinery, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"4","key":"1_CR8","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."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1), 1\u20137 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"1_CR10","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":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-75520-3_28","volume-title":"Algorithms \u2013 ESA 2007","author":"D Fotakis","year":"2007","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 299\u2013310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_28"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-79309-0_5","volume-title":"Algorithmic Game Theory","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 33\u201345. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79309-0_5"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s00224-008-9152-8","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. Theor. Comp. Sys. 47(1), 218\u2013249 (2010)","journal-title":"Theor. Comp. Sys."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/15427951.2008.10129175","volume":"5","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D., Spirakis, G.P.: Cost-balancing tolls for atomic network congestion games. Internet Math. 5(4), 343\u2013363 (2008)","journal-title":"Internet Math."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 645\u2013657. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_55"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_42"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hao, B., Michini, C.: Inefficiency of pure Nash equilibria in series-parallel network congestion games, November 2021. Optimization Online","DOI":"10.1007\/978-3-031-22832-2_1"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Hao, B., Michini, C.: The price of anarchy in series-parallel network congestion games. Math. Program. 1\u201331 (2022). https:\/\/doi.org\/10.1007\/s10107-022-01803-w","DOI":"10.1007\/s10107-022-01803-w"},{"issue":"1","key":"1_CR19","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."},{"issue":"3","key":"1_CR20","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(3), 647\u2013666 (2015)","journal-title":"Int. J. Game Theory"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 547\u2013558. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_48"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. Theoret. Comput. Sci. 406(3), 187\u2013206 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1007\/s00224-021-10038-9","volume":"65","author":"J Nickerl","year":"2021","unstructured":"Nickerl, J.: The minimum tollbooth problem in atomic network congestion games with unsplittable flows. Theor. Comp. Sys. 65(7), 1094\u20131109 (2021)","journal-title":"Theor. Comp. Sys."},{"issue":"5","key":"1_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."},{"key":"1_CR26","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. Internat. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2), 341\u2013364 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR28","unstructured":"Roughgarden, T.: The maximum latency of selfish routing. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 980\u2013981. SODA 2004, Society for Industrial and Applied Mathematics, USA (2004)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 513\u2013522. STOC 2009, Association for Computing Machinery, New York, NY, USA (2009)","DOI":"10.1145\/1536414.1536485"},{"issue":"5","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 1\u201342 (2015)","journal-title":"J. ACM"},{"issue":"2","key":"1_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"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 188\u2013195. SPAA 2004, Association for Computing Machinery, New York, NY, USA (2004)","DOI":"10.1145\/1007912.1007941"},{"issue":"2","key":"1_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\u2013316 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:46:30Z","timestamp":1710269190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}