{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:31:46Z","timestamp":1757590306366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"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-54921-3_21","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"366-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Value of Information in Selfish Routing"],"prefix":"10.1007","author":[{"given":"Simon","family":"Scherrer","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1287\/opre.2017.1712","volume":"66","author":"D Acemoglu","year":"2018","unstructured":"Acemoglu, D., Makhdoumi, A., Malekian, A., Ozdaglar, A.: Informational braess\u2019 paradox: the effect of information on traffic congestion. Oper. Res. 66(4), 893\u2013917 (2018)","journal-title":"Oper. Res."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks, vol. 5 (2001)","DOI":"10.1145\/502034.502048"},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/3085591","volume":"60","author":"D Barrera","year":"2017","unstructured":"Barrera, D., Chuat, L., Perrig, A., Reischuk, R.M., Szalachowski, P.: The scion internet architecture. Commun. ACM 60(6), 56\u201365 (2017)","journal-title":"Commun. ACM"},{"issue":"1","key":"21_CR4","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12(1), 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-79309-0_27","volume-title":"Algorithmic Game Theory","author":"C Chung","year":"2008","unstructured":"Chung, C., Ligett, K., Pruhs, K., Roth, A.: The price of stochastic anarchy. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 303\u2013314. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79309-0_27"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73","author":"SC Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Natl. Bureau Stand. B 73(2), 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bureau Stand. B"},{"issue":"10","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1109\/71.888643","volume":"11","author":"M Dahlin","year":"2000","unstructured":"Dahlin, M.: Interpreting stale load information. IEEE Trans. Parallel Distrib. Syst. 11(10), 1033\u20131047 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Dubey, P.: Inefficiency of nash equilibria. Mathematics of Operations Research 11(1), (1986)","DOI":"10.1287\/moor.11.1.1"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Filsfils, C., Nainar, N.K., Pignataro, C., Cardona, J.C., Francois, P.: The segment routing architecture. In: IEEE Global Communications Conference (GLOBECOM) (2015)","DOI":"10.1109\/GLOCOM.2015.7417124"},{"issue":"36","key":"21_CR10","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1016\/j.tcs.2008.01.055","volume":"410","author":"S Fischer","year":"2009","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive routing with stale information. Theor. Comput. Sci. 410(36), 3357\u20133371 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Friedman, E.J.: Genericity and congestion control in selfish routing. In: 43rd IEEE Conference on Decision and Control (CDC), vol. 5 (2004)","DOI":"10.1109\/CDC.2004.1429524"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/2740070.2626300","volume":"44","author":"A Gupta","year":"2015","unstructured":"Gupta, A., et al.: SDX: a software defined internet exchange. ACM SIGCOMM Comput. Commun. Rev. 44(4), 551\u2013562 (2015)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/mnsc.14.3.159","volume":"14","author":"JC Harsanyi","year":"1967","unstructured":"Harsanyi, J.C.: Games with incomplete information played by \u201cBayesian\u201d players, I\u2013III part I. The basic model. Manag. Sci. 14(3), 159\u2013182 (1967)","journal-title":"Manag. Sci."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29, 1765\u20131775 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"21_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical Analysis of Network Data (Datasets)","author":"ED Kolaczyk","year":"2009","unstructured":"Kolaczyk, E.D.: Statistical Analysis of Network Data (Datasets). Springer, Heidelberg (2009). http:\/\/math.bu.edu\/people\/kolaczyk\/datasets.html"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Kotronis, V., Kloti, R., Rost, M., Georgopoulos, P., Ager, B., Schmid, S., Dimitropoulos, X.: Stitching inter-domain paths over IXPs. In: Proceedings of ACM Symposium on SDN Research (SOSR) (2016)","DOI":"10.1145\/2890955.2890960"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Annual Symposium on Theoretical Aspects of Computer Science (STACS) (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Tardos, E.: Pure and Bayes-Nash price of anarchy for generalized second price auction. In: IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) (2010)","DOI":"10.1109\/FOCS.2010.75"},{"key":"21_CR19","unstructured":"Luizelli, M.C., Bays, L.R., Buriol, L.S., Barcellos, M.P., Gaspary, L.P.: Characterizing the impact of network substrate topologies on virtual network embedding. In: Proceedings of the 9th International Conference on Network and Service Management (CNSM). IEEE (2013)"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.824633","volume":"11","author":"M Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M.: How useful is old information? IEEE Trans. Parallel Distrib. Syst. 11(1), 6\u201320 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR21","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, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"21_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"21_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67080-5","volume-title":"SCION: A Secure Internet Architecture","author":"A Perrig","year":"2017","unstructured":"Perrig, A., Szalachowski, P., Reischuk, R.M., Chuat, L.: SCION: A Secure Internet Architecture. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-67080-5. https:\/\/netsec.ethz.ch\/publications\/papers\/SCION-book.pdf"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in internet-like environments. In: Proceedings of the ACM SIGCOMM (2003)","DOI":"10.1145\/863955.863974"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Raghavan, B., Snoeren, A.C.: A system for authenticated policy-compliant routing. In: ACM SIGCOMM Computer Communication Review, vol. 34 (2004)","DOI":"10.1145\/1030194.1015487"},{"issue":"1","key":"21_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. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"21_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. (JCSS) 67(2), 341\u2013364 (2003)","journal-title":"J. Comput. Syst. Sci. (JCSS)"},{"key":"21_CR28","first-page":"459","volume":"18","author":"T Roughgarden","year":"2007","unstructured":"Roughgarden, T.: Routing games. Algorithmic Game Theory 18, 459\u2013484 (2007)","journal-title":"Algorithmic Game Theory"},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2737816","volume":"3","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. ACM Trans. Econ. Comput. (TEAC) 3(1), 1\u201320 (2015)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"2","key":"21_CR30","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)"},{"issue":"1","key":"21_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1006\/jeth.2000.2696","volume":"97","author":"WH Sandholm","year":"2001","unstructured":"Sandholm, W.H.: Potential games with continuous player sets. J. Econ. Theory 97(1), 81\u2013108 (2001)","journal-title":"J. Econ. Theory"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Savage, S., Collins, A., Hoffman, E., Snell, J., Anderson, T.: The end-to-end effects of internet path selection. In: ACM SIGCOMM Computer Communication Review, vol. 29 (1999)","DOI":"10.1145\/316194.316233"},{"key":"21_CR33","unstructured":"Scherrer, S., Perrig, A., Schmid, S.: The value of information in selfish routing (2020). https:\/\/arxiv.org\/abs\/2005.05191"},{"key":"21_CR34","unstructured":"Schmid, L., Chatterjee, K., Schmid, S.: The evolutionary price of anarchy: locally bounded agents in a dynamic virus game. In: Proceedings of 33rd International Symposium on Distributed Computing (OPODIS) (2019)"},{"key":"21_CR35","unstructured":"Shahbaz, M., Suresh, L., Rexford, J., Feamster, N., Rottenstreich, O., Hira, M.: Elmo: source-routed multicast for cloud services. arXiv preprint arXiv:1802.09815 (2018)"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Singh, S., Soni, V., Wellman, M.: Computing approximate Bayes-Nash equilibria in tree-games of incomplete information. In: Proceedings of the 5th ACM conference on Electronic Commerce (EC) (2004)","DOI":"10.1145\/988772.988785"},{"issue":"2","key":"21_CR37","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/MIC.2018.022021673","volume":"22","author":"B Trammell","year":"2018","unstructured":"Trammell, B., Smith, J.P., Perrig, A.: Adding path awareness to the internet architecture. IEEE Internet Comput. 22(2), 96\u2013102 (2018). https:\/\/doi.org\/10.1109\/MIC.2018.022021673","journal-title":"IEEE Internet Comput."},{"issue":"3","key":"21_CR38","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1(3), 325\u2013362 (1952)","journal-title":"Proc. Inst. Civ. Eng."},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Xu, W., Rexford, J.: MIRO: multi-path Interdomain Routing. In: Proceedings of the SIGCOMM (2006)","DOI":"10.1145\/1159913.1159934"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:44:43Z","timestamp":1619232283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","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":"41","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":"46% - 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":"11","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}