{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:42:01Z","timestamp":1780522921002,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"PRIN 2022 - European Union Next Generation EU","award":["D53D23005620006"],"award-info":[{"award-number":["D53D23005620006"]}]},{"DOI":"10.13039\/100012740","name":"Gruppo Nazionale per l\u2019Analisi Matematica, la Probabilit\u00e1 e le loro Applicazioni","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012740","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016973","name":"GNSAGA","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016973","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007343","name":"Universit\u00e0 degli Studi di Brescia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007343","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Different populations of vehicles travel along a network. Each population has its origin, destination and travel costs \u2014 which may well be unbounded. Under the only requirement of the continuity of the travel costs, we prove the existence of a Nash equilibrium for all populations. Conditions for its uniqueness are also provided. A few cases are treated in detail to show specific situations of interest.<\/jats:p>","DOI":"10.1007\/s10957-025-02706-4","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T13:43:30Z","timestamp":1748267010000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nash Equilibria in Traffic Networks with Multiple Populations and Origins\u2013Destinations"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0459-585X","authenticated-orcid":false,"given":"Rinaldo M.","family":"Colombo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3975-7281","authenticated-orcid":false,"given":"Luca","family":"Giuzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1619-6565","authenticated-orcid":false,"given":"Francesca","family":"Marcellini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"issue":"3","key":"2706_CR1","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s11750-019-00516-2","volume":"27","author":"H Asienkiewicz","year":"2019","unstructured":"Asienkiewicz, H., Balbus, L.: Existence of Nash Equilibria in Stochastic Games of Resource Extraction with Risk-Sensitive Players. TOP 27(3), 502\u2013518 (2019). https:\/\/doi.org\/10.1007\/s11750-019-00516-2","journal-title":"TOP"},{"key":"2706_CR2","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven, Connecticut (1956)"},{"issue":"10","key":"2706_CR3","doi-asserted-by":"publisher","first-page":"13080","DOI":"10.1109\/TITS.2024.3399112","volume":"25","author":"E Benenati","year":"2024","unstructured":"Benenati, E., Grammatico, S.: Probabilistic Game-Theoretic Traffic Routing. IEEE Transactions on Intelligent Transportation Systems 25(10), 13080\u201313090 (2024). https:\/\/doi.org\/10.1109\/TITS.2024.3399112","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"5","key":"2706_CR4","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1017\/S0956792503005266","volume":"14","author":"S Benzoni-Gavage","year":"2003","unstructured":"Benzoni-Gavage, S., Colombo, R.M.: An $$n$$-Populations Model for Traffic Flow. European J. Appl. Math. 14(5), 587\u2013612 (2003). https:\/\/doi.org\/10.1017\/S0956792503005266","journal-title":"European J. Appl. Math."},{"key":"2706_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.physa.2018.05.018","volume":"507","author":"S Bittihn","year":"2018","unstructured":"Bittihn, S., Schadschneider, A.: Braess Paradox in a Network with Stochastic Dynamics and Fixed Strategies. Physica A: Statistical Mechanics and its Applications 507, 133\u2013152 (2018). https:\/\/doi.org\/10.1016\/j.physa.2018.05.018","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2706_CR6","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"3","key":"2706_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.3934\/nhm.2013.8.627","volume":"8","author":"A Bressan","year":"2013","unstructured":"Bressan, A., Han, K.: Existence of Optima and Equilibria for Traffic Flow on Networks. Netw. Heterog. Media 8(3), 627\u2013648 (2013). https:\/\/doi.org\/10.3934\/nhm.2013.8.627","journal-title":"Netw. Heterog. Media"},{"issue":"1","key":"2706_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10957-015-0729-5","volume":"168","author":"RM Colombo","year":"2016","unstructured":"Colombo, R.M., Holden, H.: On the Braess Paradox with Nonlinear Dynamics and Control Theory. J. Optim. Theory Appl. 168(1), 216\u2013230 (2016). https:\/\/doi.org\/10.1007\/s10957-015-0729-5","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2706_CR9","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1137\/19M1270896","volume":"80","author":"RM Colombo","year":"2020","unstructured":"Colombo, R.M., Holden, H., Marcellini, F.: On the Microscopic Modeling of Vehicular Traffic on General Networks. SIAM J. Appl. Math. 80(3), 1377\u20131391 (2020). https:\/\/doi.org\/10.1137\/19M1270896","journal-title":"SIAM J. Appl. Math."},{"key":"2706_CR10","doi-asserted-by":"crossref","unstructured":"Dafermos, S.C., Sparrow, F.T.: The Traffic Assignment Problem for a General Network. J. Res. Nat. Bur. Standards Sect. B 73B, 91\u2013118 (1969)","DOI":"10.6028\/jres.073B.010"},{"issue":"1","key":"2706_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. SIAM Journal on Computing 39(1), 195\u2013259 (2009). https:\/\/doi.org\/10.1137\/070699652","journal-title":"SIAM Journal on Computing"},{"key":"2706_CR12","doi-asserted-by":"publisher","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511761942","DOI":"10.1017\/CBO9780511761942"},{"issue":"3","key":"2706_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A Haurie","year":"1985","unstructured":"Haurie, A., Marcotte, P.: On the Relationship Between Nash-Cournot and Wardrop Equilibria. Networks 15(3), 295\u2013308 (1985). https:\/\/doi.org\/10.1002\/net.3230150303","journal-title":"Networks"},{"key":"2706_CR14","doi-asserted-by":"publisher","unstructured":"Jamous, W., Balijepalli, C.: Assessing Travel Time Reliability Implications due to Roadworks on Private Vehicles and Public Transport Services in Urban Road Networks. Journal of Traffic and Transportation Engineering (English Edition) 5(4), 296\u2013308 (2018). https:\/\/doi.org\/10.1016\/j.jtte.2017.09.003https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2095756417302416","DOI":"10.1016\/j.jtte.2017.09.003"},{"issue":"2","key":"2706_CR15","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1137\/140980685","volume":"53","author":"W Krichene","year":"2015","unstructured":"Krichene, W., Drigh\u00e8s, B., Bayen, A.M.: Online Learning of Nash Equilibria in Congestion Games. SIAM J. Control Optim. 53(2), 1056\u20131081 (2015). https:\/\/doi.org\/10.1137\/140980685","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"2706_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/trsc.1090.0258","volume":"43","author":"WH Lin","year":"2009","unstructured":"Lin, W.H., Lo, H.K.: Investigating Braess\u2019 Paradox with Time-Dependent Queues. Transportation Science 43(1), 117\u2013126 (2009). https:\/\/doi.org\/10.1287\/trsc.1090.0258","journal-title":"Transportation Science"},{"issue":"3","key":"2706_CR17","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1137\/18M1177615","volume":"57","author":"T Liu","year":"2019","unstructured":"Liu, T., Wang, J., Zhang, X., Cheng, D.: Game Theoretic Control of Multiagent Systems. SIAM J. Control Optim. 57(3), 1691\u20131709 (2019). https:\/\/doi.org\/10.1137\/18M1177615","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"2706_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10287-006-0027-7","volume":"4","author":"A Nagurney","year":"2007","unstructured":"Nagurney, A., Parkes, D., Daniele, P.: The Internet, Evolutionary Variational Inequalities, and the Time-Dependent Braess Paradox. Computational Management Science 4(4), 355\u2013375 (2007). https:\/\/doi.org\/10.1007\/s10287-006-0027-7","journal-title":"Computational Management Science"},{"key":"2706_CR19","doi-asserted-by":"publisher","unstructured":"Nash, J.: Non-Cooperative Games. Ann. of Math. 2(54), 286\u2013295 (1951). https:\/\/doi.org\/10.2307\/1969529","DOI":"10.2307\/1969529"},{"key":"2706_CR20","volume-title":"Topics in Nonlinear Functional Analysis","author":"L Nirenberg","year":"1974","unstructured":"Nirenberg, L.: Topics in Nonlinear Functional Analysis. New York University, New York, Courant Institute of Mathematical Sciences (1974)"},{"key":"2706_CR21","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, New York, NY, USA (2007)"},{"key":"2706_CR22","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.: The Complexity of Computing Equilibria. In: H.P. Young, S.\u00a0Zamir (eds.) Handbook of Game Theory with Economic Applications, vol.\u00a04, pp. 779\u2013810. Elsevier (2015). https:\/\/doi.org\/10.1016\/B978-0-444-53766-9.00014-8","DOI":"10.1016\/B978-0-444-53766-9.00014-8"},{"key":"2706_CR23","doi-asserted-by":"publisher","unstructured":"Reinolsmann, N., Alhajyaseen, W., Brijs, T., Pirdavani, A., Ross, V., Hussain, Q., Brijs, K.: Delay or Travel Time Information? The Impact of Advanced Traveler Information Systems on Drivers\u2019 Behavior Before Freeway Work Zones. Transportation Research Part F: Traffic Psychology and Behaviour 87, 454\u2013476 (2022). https:\/\/doi.org\/10.1016\/j.trf.2022.05.001https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1369847822000882","DOI":"10.1016\/j.trf.2022.05.001"},{"key":"2706_CR24","doi-asserted-by":"publisher","unstructured":"Roman, C., Turrini, P.: Multi-Population Congestion Games With Incomplete Information. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 565\u2013571. International Joint Conferences on Artificial Intelligence Organization (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/80","DOI":"10.24963\/ijcai.2019\/80"},{"key":"2706_CR25","doi-asserted-by":"publisher","unstructured":"Roughgarden, T.: Stackelberg Scheduling Strategies. SIAM Journal on Computing 33(2), 332\u2013350 (2004). https:\/\/doi.org\/10.1137\/S0097539701397059https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-2342507710&doi=10.1137%2fS0097539701397059 &partnerID=40 &md5=64c1a032ca3449815ccb9fbc2680fe27. Cited by: 143","DOI":"10.1137\/S0097539701397059"},{"key":"2706_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"key":"2706_CR27","unstructured":"Roughgarden, T., Tardos, E.: How Bad Is Selfish Routing? In: Annual Symposium on Foundations of Computer Science - Proceedings, p. 93 - 102 (2000). https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-0034497242&partnerID=40 &md5=a4d8682c3197efaec91cbf848af2aeac"},{"issue":"10","key":"2706_CR28","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic Games. Proceedings of the National Academy of Sciences 39(10), 1095\u20131100 (1953). https:\/\/doi.org\/10.1073\/pnas.39.10.1095","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"2706_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Road Paper. some Theoretical Aspects of Road Traffic Research. Proceedings of the Institution of Civil Engineers 1(3), 325\u2013362 (1952). https:\/\/doi.org\/10.1680\/ipeds.1952.11259","journal-title":"Proceedings of the Institution of Civil Engineers"},{"key":"2706_CR30","doi-asserted-by":"publisher","unstructured":"Zang, Z., Xu, X., Qu, K., Chen, R., Chen, A.: Travel Time Reliability in Transportation Networks: A Review of Methodological Developments. Transportation Research Part C: Emerging Technologies 143, 103,866 (2022). https:\/\/doi.org\/10.1016\/j.trc.2022.103866. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0968090X22002820","DOI":"10.1016\/j.trc.2022.103866"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02706-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02706-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02706-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T08:46:24Z","timestamp":1750668384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02706-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2706"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02706-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,26]]},"assertion":[{"value":"28 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"31"}}