{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:36Z","timestamp":1740109416167,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00224-019-09946-8","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T07:03:51Z","timestamp":1568099031000},"page":"339-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving Selfish Routing for Risk-Averse Players"],"prefix":"10.1007","volume":"64","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Kalimeris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8386-5912","authenticated-orcid":false,"given":"Thanasis","family":"Lianeas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"9946_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-41392-6_8","volume-title":"Algorithmic Game Theory","author":"Haris Angelidakis","year":"2013","unstructured":"Angelidakis, H., Fotakis, D., Lianeas, T.: Stochastic congestion games with risk-averse players. In: Proc. of the 6th international symposium on algorithmic game theory (SAGT \u201913), vol. 8146 of LNCS, pp. 86\u201397 (2013)"},{"key":"9946_CR2","doi-asserted-by":"crossref","unstructured":"Bonifaci, V., Salek, M., Sch\u00e4fer, G.: Efficiency of restricted tolls in non-atomic network routing games. In: Proceedings of the 4th international symposium on algorithmic game theory (SAGT \u201910), volume 6982 of LNCS, pp. 302\u2013313. Springer-Verlag (2011)","DOI":"10.1007\/978-3-642-24829-0_27"},{"issue":"4","key":"9946_CR3","doi-asserted-by":"publisher","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)","journal-title":"Math. Oper. Res."},{"key":"9946_CR4","first-page":"1","volume-title":"Algorithmic Game Theory","author":"Amos Fiat","year":"2010","unstructured":"Fiat, A., Papadimitriou, C.H.: When the players are not expectation maximizers. In: Proceedings of the 3th international symposium on algorithmic game theory (SAGT \u201910), volume 6386 of LNCS, pp. 1\u201314 (2010)"},{"key":"9946_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"L Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. Theor. Comput. Sci. 348, 217\u2013225 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9946_CR6","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proc. of the 45th IEEE Symp. on Foundations of Computer Science (FOCS \u201904), pp. 277\u2013285 (2004)"},{"key":"9946_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Spirakis, P.: Cost-balancing tolls for atomic network congestion games. In: Proceedings of the 3rd international workshop on internet and network economics (WINE \u201907), pp. 179\u2013190. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-77105-0_19"},{"key":"9946_CR8","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kalimeris, D., Lianeas, T.: Improving selfish routing for risk-averse players. In: Evangelos Markakis and Guido Scha\u0307fer, editors, Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12 Proceedings, volume 9470 of Lecture Notes in Computer Science, pp. 328\u2013342. Springer (2015)","DOI":"10.1007\/978-3-662-48995-6_24"},{"issue":"3","key":"9946_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.12.3.208","volume":"12","author":"MA Hall","year":"1978","unstructured":"Hall, M.A.: Properties of the Equilibrium State in Transportation Networks. Transp. Sci. 12(3), 208\u2013216 (1978)","journal-title":"Transp. Sci."},{"key":"9946_CR10","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Olbrich, L., Skopalik, A.: Taxing subnetworks. In: Proceedings of the 4th international workshop on internet and network economics (WINE \u201908), vol. 5385 of LNCS, pp. 286\u2013294. Springer-Verlag (2008)","DOI":"10.1007\/978-3-540-92185-1_35"},{"key":"9946_CR11","unstructured":"Jelinek, T., Klaas, M., Sch\u00e4fer, G.: Computing optimal tolls with arc restrictions and heterogeneous players. In: Proceedings of the 31st annual symposium on theoretical aspects of computer science (STACS \u201914), volume 25 of LIPIcs, pages 433\u2013444. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"9946_CR12","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge pricing of multicommodity networks for heterogeneous users. In: Proceedings of the 45th IEEE Symp. on Foundations of Computer Science (FOCS \u201904), pp. 268\u2013276 (2004)"},{"key":"9946_CR13","doi-asserted-by":"crossref","unstructured":"Kleer, P., Sch\u00e4fer, G.: The impact of worst-case deviations in non-atomic network routing games. In: Martin Gairing and Rahul Savani, editors, Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21 Proceedings, volume 9928 of Lecture Notes in Computer Science, pp. 129\u2013140. Springer (2016)","DOI":"10.1007\/978-3-662-53354-3_11"},{"key":"9946_CR14","unstructured":"Lianeas, T., Nikolova, E., Stier Moses, N.E.: Asymptotically tight bounds for inefficiency in risk-averse selfish routing. In: Kambhampati, S. (ed.) Proceedings of the 25th international joint conference on artificial intelligence, IJCAI 2016, pp 338\u2013344. IJCAI\/AAAI Press, New York (2016)"},{"key":"9946_CR15","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-24829-0_28","volume-title":"Algorithmic Game Theory","author":"Evdokia Nikolova","year":"2011","unstructured":"Nikolova, E., Stier Moses, N.: Stochastic selfish routing. In: Proceedings of the 4th international symposium on algorithmic game theory (SAGT \u201911), volume 6982 of LNCS, pp. 314\u2013325 (2011)"},{"key":"9946_CR16","doi-asserted-by":"crossref","unstructured":"Nikolova, E., Stier-Moses, N.: The burden of risk aversion in mean-risk selfish routing. In: Proceedings of the 16th ACM conference on electronic commerce (EC \u201915), pp. 489\u2013506 (2015)","DOI":"10.1145\/2764468.2764485"},{"issue":"1","key":"9946_CR17","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.: Wardrop equilibria with risk-averse users. Transp. Sci. 44(1), 63\u201386 (2010)","journal-title":"Transp. Sci."},{"key":"9946_CR18","doi-asserted-by":"crossref","unstructured":"Piliouras, G., Nikolova, E., Shamma, J.S.: Risk sensitivity of price of anarchy under uncertainty. In: Proceedings of the 14th ACM conference on electronic commerce (EC \u201913), pp. 715\u2013732 (2013)","DOI":"10.1145\/2492002.2482578"},{"issue":"2","key":"9946_CR19","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM J.Comput. 33(2), 332\u2013350 (2004)","journal-title":"SIAM J.Comput."},{"key":"9946_CR20","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"issue":"2","key":"9946_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.2307\/1914185","volume":"47","author":"A Tversky","year":"1979","unstructured":"Tversky, A., Kahneman, D.: Prospect theory: An analysis of decision under risk. Econometrica 47(2), 263\u2013291 (1979)","journal-title":"Econometrica"},{"issue":"2","key":"9946_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdez","year":"1982","unstructured":"Valdez, J., Tarjan, R.E., Lawler, E.L.: The Recognition of Series-Parallel Digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09946-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-019-09946-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09946-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T10:27:03Z","timestamp":1599733623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-019-09946-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9946"],"URL":"https:\/\/doi.org\/10.1007\/s00224-019-09946-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"10 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}