{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:44:24Z","timestamp":1768416264026,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030649456","type":"print"},{"value":"9783030649463","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_18","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"252-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4867-5149","authenticated-orcid":false,"given":"Francisco","family":"Benita","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7848-4904","authenticated-orcid":false,"given":"Vittorio","family":"Bil\u00f2","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6940-974X","authenticated-orcid":false,"given":"Barnab\u00e9","family":"Monnot","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6236-3566","authenticated-orcid":false,"given":"Georgios","family":"Piliouras","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7741-9342","authenticated-orcid":false,"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Benita, F., Bil\u00f2, V., Monnot, B., Piliouras, G., Vinci, C.: Data-driven models of selfish routing: why price of anarchy does depend on network topology. arXiv preprint arXiv:2009.12871 (2020)","DOI":"10.1007\/978-3-030-64946-3_18"},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/s00224-017-9826-1","volume":"62","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. Theory Comput. Syst. 62(5), 1288\u20131317 (2018)","journal-title":"Theory Comput. Syst."},{"key":"18_CR3","unstructured":"Bil\u00f2, V., Vinci, C.: On the impact of singleton strategies in congestion games. In: 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"18_CR4","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":"18_CR5","unstructured":"Bureau of Public Roads: Traffic assignment manual. US Department of Commerce (1964)"},{"key":"18_CR6","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. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-71924-5_10","volume-title":"Web and Internet Economics","author":"R Colini-Baldeschi","year":"2017","unstructured":"Colini-Baldeschi, R., Cominetti, R., Mertikopoulos, P., Scarsini, M.: The asymptotic behavior of the price of anarchy. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 133\u2013145. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_10"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-53354-3_10","volume-title":"Algorithmic Game Theory","author":"R Colini-Baldeschi","year":"2016","unstructured":"Colini-Baldeschi, R., Cominetti, R., Scarsini, M.: On the price of anarchy of highly congested nonatomic network games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 117\u2013128. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_10"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11944874_29","volume-title":"Internet and Network Economics","author":"D Dumrauf","year":"2006","unstructured":"Dumrauf, D., Gairing, M.: Price of anarchy for polynomial wardrop games. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds.) WINE 2006. LNCS, vol. 4286, pp. 319\u2013330. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944874_29"},{"issue":"1","key":"18_CR10","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(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"key":"18_CR11","unstructured":"Gemici, K., Koutsoupias, E., Monnot, B., Papadimitriou, C.H., Piliouras, G.: Wealth inequality and the price of anarchy. In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O Jahn","year":"2005","unstructured":"Jahn, O., M\u00f6hring, R.H., Schulz, A.S., Moses, N.E.S.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4), 600\u2013616 (2005)","journal-title":"Oper. Res."},{"key":"18_CR13","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 99","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":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kulkarni, J., Mirrokni, V.S.: Robust price of anarchy bounds via LP and fenchel duality. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1030\u20131049. SIAM (2015)","DOI":"10.1137\/1.9781611973730.70"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/s11390-012-1257-5","volume":"27","author":"PY Lu","year":"2012","unstructured":"Lu, P.Y., Yu, C.Y.: Worst-case Nash equilibria in restricted routing. J. Comput. Sci. Technol. 27(4), 710\u2013717 (2012)","journal-title":"J. Comput. Sci. Technol."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-71924-5_24","volume-title":"Web and Internet Economics","author":"B Monnot","year":"2017","unstructured":"Monnot, B., Benita, F., Piliouras, G.: Routing games in the wild: efficiency, equilibration and regret. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 340\u2013353. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_24"},{"key":"18_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-29643-2_19","volume-title":"Complex Systems Design & Management Asia","author":"B Monnot","year":"2016","unstructured":"Monnot, B., et al.: Inferring activities and optimal trips: lessons from Singapore\u2019s national science experiment. In: Cardin, M.-A., Fong, S.H., Krob, D., Lui, P.C., Tan, Y.H. (eds.) Complex Systems Design & Management Asia. AISC, vol. 426, pp. 247\u2013264. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29643-2_19"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-17572-5_26","volume-title":"Internet and Network Economics","author":"U Nadav","year":"2010","unstructured":"Nadav, U., Roughgarden, T.: The limits of smoothness: a primal-dual framework for price of anarchy bounds. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 319\u2013326. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_26"},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1475-3995.2009.00659.x","volume":"16","author":"A Nagurney","year":"2009","unstructured":"Nagurney, A., Qiang, Q.: A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior. Int. Trans. Oper. Res. 16(1), 49\u201367 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, pp. 749\u2013753. ACM (2001)","DOI":"10.1145\/380752.380883"},{"issue":"2","key":"18_CR21","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."},{"issue":"5","key":"18_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM (JACM) 62(5), 32 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"key":"18_CR24","unstructured":"Thang, N.K.: Game efficiency through linear programming duality. In: Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. LIPIcs 124, pp. 66:1\u201366:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"4","key":"18_CR25","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1287\/trsc.22.4.242","volume":"22","author":"RL Tobin","year":"1988","unstructured":"Tobin, R.L., Friesz, T.L.: Sensitivity analysis for equilibrium network flow. Transp. Sci. 22(4), 242\u2013250 (1988)","journal-title":"Transp. Sci."},{"key":"18_CR26","unstructured":"Wardrop, J.: Some Theoretical Aspects of Road Traffic Research. Road paper, Institution of Civil Engineers (1952). https:\/\/books.google.it\/books?id=9zEpAQAAMAAJ"},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/JPROC.2018.2790405","volume":"106","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Pourazarm, S., Cassandras, C.G., Paschalidis, I.C.: The price of anarchy in transportation networks: data-driven evaluation and reduction strategies. Proc. IEEE 106(4), 538\u2013553 (2018)","journal-title":"Proc. IEEE"},{"key":"18_CR28","unstructured":"Zhou, Y., Wang, J., Shi, P., Dahlmeier, D., Tippenhauer, N., Wilhelm, E.: Power-saving transportation mode identification for large-scale applications. arXiv preprint arXiv:1701.05768 (2017)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T18:29:11Z","timestamp":1618597751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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":"10","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)"}}]}}