{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T21:29:28Z","timestamp":1764019768903},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_28","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"314-325","source":"Crossref","is-referenced-by-count":17,"title":["Stochastic Selfish Routing"],"prefix":"10.1007","author":[{"given":"Evdokia","family":"Nikolova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas E.","family":"Stier-Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E. Altman","year":"2006","unstructured":"Altman, E., Boulogne, T., El-Azouzi, R., Jim\u00e9nez, T., Wynter, L.: A survey on networking games in telecommunications. Computers and Operations Research\u00a033(2), 286\u2013311 (2006)","journal-title":"Computers and Operations Research"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/net.3230180306","volume":"18","author":"G. Andreatta","year":"1988","unstructured":"Andreatta, G., Romeo, L.: Stochastic shortest paths with recourse. Networks\u00a018, 193\u2013204 (1988)","journal-title":"Networks"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1145\/1160633.1160782","volume-title":"Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS)","author":"I. Ashlagi","year":"2006","unstructured":"Ashlagi, I., Monderer, D., Tennenholtz, M.: Resource selection games with unknown number of players. In: Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Hakodate, Japan, pp. 819\u2013825. ACM Press, New York (2006)"},{"key":"28_CR4","volume-title":"Studies in the Economics of Transportation","author":"M.J. Beckmann","year":"1956","unstructured":"Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"8","key":"28_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0191-2615(01)00022-4","volume":"36B","author":"M.G.H. Bell","year":"2002","unstructured":"Bell, M.G.H., Cassir, C.: Risk-averse user equilibrium traffic assignment: an application of game theory. Transportation Research\u00a036B(8), 671\u2013681 (2002)","journal-title":"Transportation Research"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Mathematics of Operations Research\u00a016(3), 580\u2013595 (1991)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"28_CR7","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research\u00a029(4), 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.geb.2008.01.001","volume":"64","author":"J.R. 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 and Economic Behavior\u00a064, 457\u2013469 (2008)","journal-title":"Games and Economic Behavior"},{"key":"28_CR9","volume-title":"Encyclopedia of Operations Research and Management Science","author":"J.R. Correa","year":"2011","unstructured":"Correa, J.R., Stier-Moses, N.E.: Wardrop equilibria. In: Cochran, J.J. (ed.) Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2011)"},{"key":"28_CR10","first-page":"91","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the U.S. National Bureau of Standards\u00a073B, 91\u2013118 (1969)","journal-title":"Journal of Research of the U.S. National Bureau of Standards"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0041-1647(71)90012-8","volume":"5","author":"R.B. Dial","year":"1971","unstructured":"Dial, R.B.: A probabilistic multi-path traffic assignment algorithm which obviates path enumeration. Transportation Research\u00a05(2), 83\u2013111 (1971)","journal-title":"Transportation Research"},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10957-005-7498-5","volume":"127","author":"Y.Y. Fan","year":"2005","unstructured":"Fan, Y.Y., Kalaba, R.E., Moore, J.E.: Arriving on time. Journal of Optimization Theory and Applications\u00a0127(3), 497\u2013513 (2005)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.camwa.2004.07.028","volume":"49","author":"Y.Y. Fan","year":"2005","unstructured":"Fan, Y.Y., Kalaba, R.E., Moore, J.E.: Shortest paths in stochastic networks with correlated link costs. Computers and Mathematics with Applications\u00a049, 1549\u20131564 (2005)","journal-title":"Computers and Mathematics with Applications"},{"key":"28_CR14","doi-asserted-by":"publisher","DOI":"10.1515\/9783110212075","volume-title":"Stochastic Finance: An Introduction in Discrete Time","author":"H. F\u00f6llmer","year":"2004","unstructured":"F\u00f6llmer, H., Schied, A.: Stochastic Finance: An Introduction in Discrete Time. Walter de Gruyter, Berlin (2004)"},{"key":"28_CR15","unstructured":"Langer, G.: Traffic in the united states. ABC News, February 13 (2005)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.3141\/1783-16","volume":"1783","author":"H. Liu","year":"2002","unstructured":"Liu, H., Ban, X., Ran, B., Mirchandani, P.: An analytical dynamic traffic assignment model with stochastic network and travelers\u2019 perceptions. Transportation Research Record\u00a01783, 125\u2013133 (2002)","journal-title":"Transportation Research Record"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0191-2615(02)00017-6","volume":"37B","author":"H.K. Lo","year":"2003","unstructured":"Lo, H.K., Tung, Y.-K.: Network with degradable links: capacity analysis and design. Transportation Research\u00a037B(4), 345\u2013363 (2003)","journal-title":"Transportation Research"},{"key":"28_CR18","volume-title":"Mean-Variance Analysis in Portfolio Choice and Capital Markets","author":"H.M. Markowitz","year":"1987","unstructured":"Markowitz, H.M.: Mean-Variance Analysis in Portfolio Choice and Capital Markets. Basil Blackwell, Cambridge (1987)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/trsc.21.3.133","volume":"21","author":"P.B. Mirchandani","year":"1987","unstructured":"Mirchandani, P.B., Soroush, H.: Generalized traffic equilibrium with probabilistic travel times and perceptions. Transportation Science\u00a021, 133\u2013152 (1987)","journal-title":"Transportation Science"},{"key":"28_CR20","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 and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Noncooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.trb.2009.01.008","volume":"43","author":"Y. Nie","year":"2009","unstructured":"Nie, Y., Wu, X.: Shortest path problem considering on-time arrival probability. Transportation Research Part B\u00a043, 597\u2013613 (2009)","journal-title":"Transportation Research Part B"},{"key":"28_CR23","unstructured":"Nikolova, E.: Strategic algorithms. PhD thesis, Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science (2009)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-15369-3_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E. Nikolova","year":"2010","unstructured":"Nikolova, E.: Approximation algorithms for reliable stochastic combinatorial optimization. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010, LNCS, vol.\u00a06302, pp. 338\u2013351. Springer, Heidelberg (2010)"},{"key":"28_CR25","unstructured":"Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (eds.) Proceedings of the International Conference on Automated Planning & Scheduling (ICAPS), Cumbria, England, pp. 131\u2013141 (2006)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/11841036_50","volume-title":"Algorithms \u2013 ESA 2006","author":"E. Nikolova","year":"2006","unstructured":"Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 552\u2013563. Springer, Heidelberg (2006)"},{"key":"28_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/trsc.1090.0292","volume":"44","author":"F. Ord\u00f3\u00f1ez","year":"2010","unstructured":"Ord\u00f3\u00f1ez, F., Stier-Moses, N.E.: Wardrop equilibria with risk-averse users. Transportation Science\u00a044(1), 63\u201386 (2010)","journal-title":"Transportation Science"},{"key":"28_CR29","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Greece, pp. 749\u2013753. ACM Press, New York (2001)"},{"key":"28_CR30","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, London (1920)"},{"issue":"2","key":"28_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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"28_CR32","unstructured":"Schrank, D., Lomax, T., Turner, S.: Annual urban mobility report (2010), Texas Transportation Institute, http:\/\/mobility.tamu.edu\/ums"},{"key":"28_CR33","volume-title":"Urban Transportation Networks","author":"Y. Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transportation Networks. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"28_CR34","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/net.3230120209","volume":"12","author":"Y. Sheffi","year":"1982","unstructured":"Sheffi, Y., Powell, W.: An algorithm for the traffic assignment problem with random link costs. Networks\u00a012, 191\u2013207 (1982)","journal-title":"Networks"},{"issue":"4","key":"28_CR35","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/trsc.8.4.311","volume":"8","author":"M. Trahan","year":"1974","unstructured":"Trahan, M.: Probabilistic assignment: An algorithm. Transportation Science\u00a08(4), 311\u2013320 (1974)","journal-title":"Transportation Science"},{"issue":"2","key":"28_CR36","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3328\/TL.2010.02.02.111-123","volume":"2","author":"S.V. Ukkusuri","year":"2010","unstructured":"Ukkusuri, S.V., Waller, S.T.: Approximate Analytical Expressions for Transportation Network Performance under Demand Uncertainty. Transportation Letters: The International Journal of Transportation Research\u00a02(2), 111\u2013123 (2010)","journal-title":"Transportation Letters: The International Journal of Transportation Research"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:57:10Z","timestamp":1560729430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}