{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:50:50Z","timestamp":1743137450321,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031426254"},{"type":"electronic","value":"9783031426261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42626-1_1","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T14:05:02Z","timestamp":1693231502000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the\u00a0Price of\u00a0Anarchy in\u00a0Atomic Network Congestion Games (Invited Talk)"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Markey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS 2004, pp.. 295\u2013304. IEEE Comp. Soc. Press, (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.68","DOI":"10.1109\/FOCS.2004.68"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Avni, G., Guha, S., Kupferman, O.: Timed network games. In: MFCS 2017. LIPIcs, vol. 84, pp. 37:1\u201337:16. Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2017.37","DOI":"10.4230\/LIPIcs.MFCS.2017.37"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Avni, G., Guha, S., Kupferman, O.: Timed network games with clocks. In: MFCS 2018. LIPIcs. vol. 117, pp. 23:1\u201323:18. Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.23","DOI":"10.4230\/LIPIcs.MFCS.2018.23"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53354-3_13","volume-title":"Algorithmic Game Theory","author":"G Avni","year":"2016","unstructured":"Avni, G., Henzinger, T.A., Kupferman, O.: Dynamic resource allocation games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 153\u2013166. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_13"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC 2005, pp. 57\u201366. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060599","DOI":"10.1145\/1060590.1060599"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Markey, N., Sadhukhan, S., Sankur, O.: Dynamic network congestion games. In: FSTTCS 2020. LIPIcs 182, pp. 40:1\u201340:16. Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2020.40","DOI":"10.4230\/LIPIcs.FSTTCS.2020.40"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Markey, N., Sadhukhan, S., Sankur, O.: Semilinear representations for series-parallel atomic congestion games. In: FSTTCS 2022. LIPIcs, vol. 250, pp. 32:1\u201332:20. Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2022.32","DOI":"10.4230\/LIPIcs.FSTTCS.2022.32"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Brihaye, Th., Bruy\u00e8re, V., Goeminne, A., Raskin, J.-F., Van\u00a0den Bogaard, M.: The complexity of subgame perfect equilibria in quantitative reachability games. In CONCUR 2019. LIPIcs, vol. 140, pp. 13:1\u201313:16. Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.13","DOI":"10.4230\/LIPIcs.CONCUR.2019.13"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In STOC 2005, pp. 67\u201373. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060600","DOI":"10.1145\/1060590.1060600"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Colini-Baldeschi, R., Cominetti, R., Mertikopoulos, P., Scarsini, M.: When is selfish routing bad? The price of anarchy in light and heavy traffic. Operations Res. 68(2):411\u2013434 (2020). https:\/\/doi.org\/10.1287\/opre.2019.1894","DOI":"10.1287\/opre.2019.1894"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Cominetti, R., Dose, V., Scarsini, M.: The price of anarchy in routing games as a function of the demand. Math. Program (2023). https:\/\/doi.org\/10.1007\/s10107-021-01701-7 (to\u00a0appear)","DOI":"10.1007\/s10107-021-01701-7"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Correa, J.R., de\u00a0Jong, J., de\u00a0Keizer, B., Uetz, M.: The inefficiency of Nash and subgame-perfect equilibria for network routing. Math. Operat. Res. 44(4), 1286\u20131303 (2019). https:\/\/doi.org\/10.1287\/moor.2018.0968","DOI":"10.1287\/moor.2018.0968"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Fabrikant, A., Papadimitriou, Ch.H., Talwar, K.: The complexity of pure Nash equilibria. In STOC 2004, pp. 604\u2013612. ACM Press (2004). https:\/\/doi.org\/10.1145\/1007352.1007445","DOI":"10.1145\/1007352.1007445"},{"key":"1_CR15","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"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.G.: Selfish unsplittable flows. Theor.\u00a0Comput. Sci. 348(2-3), 226\u2013239 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.024","DOI":"10.1016\/j.tcs.2005.09.024"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pac. J. Math."},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Goeminne, A., Markey, N., and Sankur, O.: Non-blind strategies in timed network congestion games. In: FORMATS 2022. LNCS, vol. 13465, pp. 183\u2013199. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_11","DOI":"10.1007\/978-3-031-15839-1_11"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Hao, B., Michini, C.: Inefficiency of pure nash equilibria in series-parallel network congestion games. In: WINE 2022, LNCS, vol. 13778, pp. 3\u201320. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22832-2_1","DOI":"10.1007\/978-3-031-22832-2_1"},{"issue":"39","key":"1_CR20","doi-asserted-by":"publisher","first-page":"5420","DOI":"10.1016\/j.tcs.2011.05.055","volume":"412","author":"M Hoefer","year":"2011","unstructured":"Hoefer, M., Mirrokni, V.S., R\u00f6glin, H., Teng, S.-H.: Competitive routing over time. Theor. Comput. Sci. 412(39), 5420\u20135432 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.055","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-010-9299-y","volume":"49","author":"R Koch","year":"2011","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory Comput. Syst. 49(1), 71\u201397 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9299-y","journal-title":"Theory Comput. Syst."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/11600930_100","volume-title":"Internet and Network Economics","author":"S Kontogiannis","year":"2005","unstructured":"Kontogiannis, S., Spirakis, P.: Atomic selfish routing in networks: a survey. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 989\u20131002. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11600930_100"},{"key":"1_CR23","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":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-642-31585-5_55","volume-title":"Automata, Languages, and Programming","author":"E Koutsoupias","year":"2012","unstructured":"Koutsoupias, E., Papakonstantinopoulou, K.: Contention issues in congestion games. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 623\u2013635. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_55"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. Algorithmica 48(1), 91\u2013126 (2007). https:\/\/doi.org\/10.1007\/s00453-006-0056-1","journal-title":"Algorithmica"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, \u00c9.: The curse of simultaneity. In: ITCS 2012, pp. 60\u201367. ACM Press (2012). https:\/\/doi.org\/10.1145\/2090236.2090242","DOI":"10.1145\/2090236.2090242"},{"key":"1_CR27","unstructured":"Pigou, A.C.: The\u00a0economics of welfare. MacMillan and Co. (1920)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"R.\u00a0W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2(1):65\u201367, 1973","DOI":"10.1007\/BF01737559"},{"issue":"1","key":"1_CR29","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). https:\/\/doi.org\/10.1002\/net.3230030104","journal-title":"Networks"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Routing games. In: Algorithmic Game Theory, chapter\u00a018, pp. 461\u2013486. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.020"},{"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, \u00c9.: How bad is selfish routing? J. of the ACM 49(2), 236\u2013259 (2002). https:\/\/doi.org\/10.1145\/506147.506153","journal-title":"J. of the ACM"},{"issue":"2","key":"1_CR32","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, \u00c9.: Bounding the inefficiency of equilibria in non-atomic congestion games. Games Econ. Behav. 47(2), 389\u2013403 (2004). https:\/\/doi.org\/10.1016\/j.geb.2003.06.004","journal-title":"Games Econ. Behav."},{"key":"1_CR33","unstructured":"Sadhukhan, S.: A Verification Viewpoint on Network Congestion Games. PhD thesis, Universit\u00e9 Rennes 1, France (2021)"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00186-009-0293-6","volume":"71","author":"H Sperber","year":"2010","unstructured":"Sperber, H.: How to find Nash equilibria with extreme total latency in network congestion games? Math. Methods Operat. Res. 71(2), 245\u2013265 (2010). https:\/\/doi.org\/10.1007\/s00186-009-0293-6","journal-title":"Math. Methods Operat. Res."},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. In STOC 1979, pp. 1\u201312. ACM Press (1979). https:\/\/doi.org\/10.1145\/800135.804393","DOI":"10.1145\/800135.804393"},{"issue":"3","key":"1_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civil Eng. 1(3), 325\u2013362 (1952). https:\/\/doi.org\/10.1680\/ipeds.1952.11259","journal-title":"Proc. Inst. Civil Eng."}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42626-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T23:08:14Z","timestamp":1693264094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42626-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426254","9783031426261"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42626-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Antwerp","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uantwerpen.be\/en\/conferences\/confest-2023\/","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":"21","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":"9","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":"43% - 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.143","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":"2.063","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)"}}]}}