{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:41:28Z","timestamp":1768282888593,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662533536","type":"print"},{"value":"9783662533543","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_10","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"117-128","source":"Crossref","is-referenced-by-count":12,"title":["On the Price of Anarchy of Highly Congested Nonatomic Network Games"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Colini-Baldeschi","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Cominetti","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Scarsini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"10_CR1","volume-title":"Variational Convergence for Functions and Operators","author":"H Attouch","year":"1984","unstructured":"Attouch, H.: Variational Convergence for Functions and Operators. Pitman, Boston (1984)"},{"key":"10_CR2","volume-title":"Studies in the Economics of Transportation","author":"MJ Beckmann","year":"1956","unstructured":"Beckmann, M.J., McGuire, C., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"10_CR3","volume-title":"Regular Variation, Encyclopedia of Mathematics and its Applications","author":"NH Bingham","year":"1989","unstructured":"Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation, Encyclopedia of Mathematics and its Applications, vol. 27. Cambridge University Press, Cambridge (1989)"},{"key":"10_CR4","unstructured":"Cole, R., Tao, Y.: The price of anarchy of large Walrasian auctions. Technical report, arXiv:1508.07370v4 (2015). http:\/\/arxiv.org\/abs\/1508.07370"},{"issue":"4","key":"10_CR5","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004). http:\/\/dx.doi.org\/10.1287\/moor.1040.0098","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"JR Correa","year":"2007","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Fast, fair, and efficient flows in networks. Oper. Res. 55(2), 215\u2013225 (2007). http:\/\/dx.doi.org\/10.1287\/opre.1070.0383","journal-title":"Oper. Res."},{"issue":"2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.geb.2008.01.001","volume":"64","author":"JR Correa","year":"2008","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: A geometric approach to the price of anarchy in nonatomic congestion games. Games Econom. Behav. 64(2), 457\u2013469 (2008). http:\/\/dx.doi.org\/10.1016\/j.geb.2008.01.001","journal-title":"Games Econom. Behav."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 319\u2013330. Springer, Heidelberg (2006). http:\/\/dx.doi.org\/10.1007\/11944874_29"},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-009-9196-4","volume":"47","author":"M Englert","year":"2010","unstructured":"Englert, M., Franke, T., Olbrich, L.: Sensitivity of Wardrop equilibria. Theory Comput. Syst. 47(1), 3\u201314 (2010). http:\/\/dx.doi.org\/10.1007\/s00224-009-9196-4","journal-title":"Theory Comput. Syst."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Immorlica, N., Lucier, B., Roughgarden, T., Syrgkanis, V.: The price of anarchy in large games. Technical report, arXiv:1503.04755 (2015)","DOI":"10.1145\/2897518.2897580"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Florian, M., Hearn, D.: Network equilibrium and pricing. In: Hall, R.W. (ed.) Handbook of Transportation Science, pp. 373\u2013411. Springer, US, 978-0-306-48058-4 (2003). http:\/\/dx.doi.org\/10.1007\/0-306-48058-1_11","DOI":"10.1007\/0-306-48058-1_11"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez Vay\u00e1, M., Grammatico, S., Andersson, G., Lygeros, J.: On the price of being selfish in large populations of plug-in electric vehicles. In: 2015 54th IEEE Conference on Decision and Control (CDC), pp. 6542\u20136547 (2015)","DOI":"10.1109\/CDC.2015.7403250"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.trb.2005.12.004","volume":"41","author":"M Josefsson","year":"2007","unstructured":"Josefsson, M., Patriksson, M.: Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design. Transp. Res. Part B: Methodol. 41(1), 4\u201331 (2007). http:\/\/dx.doi.org\/10.1016\/j.trb.2005.12.004","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1007\/3-540-49116-3_38"},{"issue":"10","key":"10_CR15","doi-asserted-by":"crossref","first-page":"3778","DOI":"10.1109\/TWC.2012.083112.120371","volume":"11","author":"LM Law","year":"2012","unstructured":"Law, L.M., Huang, J., Liu, M.: Price of anarchy for congestion games in cognitive radio networks. IEEE Trans. Wireless Commun. 11(10), 3778\u20133787 (2012)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"3","key":"10_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-4068(84)90029-6","volume":"13","author":"A Mas-Colell","year":"1984","unstructured":"Mas-Colell, A.: On a theorem of Schmeidler. J. Math. Econom. 13(3), 201\u2013206 (1984). http:\/\/dx.doi.org\/10.1016\/0304-4068(84)90029-6","journal-title":"J. Math. Econom."},{"issue":"3","key":"10_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1287\/moor.25.3.349.12220","volume":"25","author":"I Milchtaich","year":"2000","unstructured":"Milchtaich, I.: Generic uniqueness of equilibrium in large crowding games. Math. Oper. Res. 25(3), 349\u2013364 (2000). http:\/\/dx.doi.org\/10.1287\/moor.25.3.349.12220","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10_CR18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/S0022-0531(03)00106-6","volume":"114","author":"I Milchtaich","year":"2004","unstructured":"Milchtaich, I.: Social optimality and cooperation in nonatomic congestion games. J. Econom. Theory 114(1), 56\u201387 (2004). http:\/\/dx.doi.org\/10.1016\/S0022-0531(03)00106-6","journal-title":"J. Econom. Theory"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.trb.2015.12.005","volume":"84","author":"SJ O\u2019Hare","year":"2016","unstructured":"O\u2019Hare, S.J., Connors, R.D., Watling, D.P.: Mechanisms that govern how the price of anarchy varies with travel demand. Transp. Res. Part B: Methodol. 84, 55\u201380 (2016). http:\/\/dx.doi.org\/10.1016\/j.trb.2015.12.005","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10_CR20","unstructured":"Panageas, I., Piliouras, G.: Approximating the geometry of dynamics in potential games. Technical report, arXiv:1403.3885v5 (2015). https:\/\/arxiv.org\/abs\/1403.3885"},{"key":"10_CR21","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. (2001). http:\/\/dx.doi.org\/10.1145\/380752.380883","DOI":"10.1145\/380752.380883"},{"issue":"3","key":"10_CR22","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/trsc.1030.0043","volume":"38","author":"M Patriksson","year":"2004","unstructured":"Patriksson, M.: Sensitivity analysis of traffic equilibria. Transp. Sci. 38(3), 258\u2013281 (2004). http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/trsc.1030.0043","journal-title":"Transp. Sci."},{"key":"10_CR23","volume-title":"The Economics of Welfare","author":"AC Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare, 1st edn. Macmillan and Co., London (1920)","edition":"1"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Piliouras, G., Nikolova, E., Shamma, J.S.: Risk sensitivity of price of anarchy under uncertainty. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, EC 2013, pp. 715\u2013732. ACM, New York (2013). http:\/\/doi.acm.org\/10.1145\/2482540.2482578","DOI":"10.1145\/2492002.2482578"},{"issue":"2","key":"10_CR25","doi-asserted-by":"crossref","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. System Sci. 67(2), 341\u2013364 (2003). http:\/\/dx.doi.org\/10.1016\/S0022-0000(03)00044-8","journal-title":"J. Comput. System Sci."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Routing games. In: Algorithmic Game Theory, pp. 461\u2013486. Cambridge Univ. Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.020"},{"issue":"2","key":"10_CR27","doi-asserted-by":"crossref","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 49(2), 236\u2013259 (2002). (electronic) http:\/\/dx.doi.org\/10.1145\/506147.506153","journal-title":"J. ACM"},{"issue":"2","key":"10_CR28","doi-asserted-by":"crossref","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 nonatomic congestion games. Games Econom. Behav. 47(2), 389\u2013403 (2004). http:\/\/dx.doi.org\/10.1016\/j.geb.2003.06.004","journal-title":"Games Econom. Behav."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: Introduction to the inefficiency of equilibria. In: Algorithmic Game Theory, pp. 443\u2013459. Cambridge Univ. Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.019"},{"key":"10_CR30","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01014905","volume":"7","author":"D Schmeidler","year":"1973","unstructured":"Schmeidler, D.: Equilibrium points of nonatomic games. J. Statist. Phys. 7, 295\u2013300 (1973)","journal-title":"J. Statist. Phys."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325\u2013378 (1952). http:\/\/dx.doi.org\/10.1680\/ipeds.1952.11362","DOI":"10.1680\/ipeds.1952.11362"},{"key":"10_CR32","doi-asserted-by":"crossref","first-page":"128701","DOI":"10.1103\/PhysRevLett.101.128701","volume":"101","author":"H Youn","year":"2008","unstructured":"Youn, H., Gastner, M.T., Jeong, H.: Price of anarchy in transportation networks: efficiency and optimality control. Phys. Rev. Lett. 101, 128701 (2008). http:\/\/dx.doi.org\/10.1103\/PhysRevLett.101.128701","journal-title":"Phys. Rev. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T01:54:10Z","timestamp":1568339650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}