{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:43Z","timestamp":1759638523023,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_24","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"328-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improving Selfish Routing for Risk-Averse Players"],"prefix":"10.1007","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"}]},{"given":"Thanasis","family":"Lianeas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-41392-6_8","volume-title":"Algorithmic Game Theory","author":"H Angelidakis","year":"2013","unstructured":"Angelidakis, H., Fotakis, D., Lianeas, T.: Stochastic congestion games with risk-averse players. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 86\u201397. Springer, Heidelberg (2013)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-24829-0_27","volume-title":"Algorithmic Game Theory","author":"V Bonifaci","year":"2011","unstructured":"Bonifaci, V., Salek, M., Sch\u00e4fer, G.: Efficiency of restricted tolls in non-atomic network routing games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 302\u2013313. Springer, Heidelberg (2011)"},{"issue":"4","key":"24_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":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16170-4_1","volume-title":"Algorithmic Game Theory","author":"A Fiat","year":"2010","unstructured":"Fiat, A., Papadimitriou, C.: When the players are not expectation maximizers. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 1\u201314. Springer, Heidelberg (2010)"},{"key":"24_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. Theoret. Comput. Sci. 348, 217\u2013225 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77105-0_19","volume-title":"Internet and Network Economics","author":"DA Fotakis","year":"2007","unstructured":"Fotakis, D.A., Spirakis, P.G.: Cost-balancing tolls for atomic network congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 179\u2013190. Springer, Heidelberg (2007)"},{"issue":"3","key":"24_CR8","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":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-92185-1_35","volume-title":"Internet and Network Economics","author":"M Hoefer","year":"2008","unstructured":"Hoefer, M., Olbrich, L., Skopalik, A.: Taxing subnetworks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 286\u2013294. Springer, Heidelberg (2008)"},{"key":"24_CR10","unstructured":"Jelinek, T., Klaas, M., Sch\u00e4fer, G.: Computing optimal tolls with arc restrictions and heterogeneous players. In: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), LIPIcs 25, pp. 433\u2013444 (2014)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge pricing of multicommodity networks for heterogeneous users. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-24829-0_28","volume-title":"Algorithmic Game Theory","author":"E Nikolova","year":"2011","unstructured":"Nikolova, E., Stier-Moses, N.E.: Stochastic selfish routing. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 314\u2013325. Springer, Heidelberg (2011)"},{"key":"24_CR13","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 2015), pp. 489\u2013506 (2015)","DOI":"10.1145\/2764468.2764485"},{"issue":"1","key":"24_CR14","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":"24_CR15","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 2013), pp. 715\u2013732 (2013)","DOI":"10.1145\/2492002.2482578"},{"issue":"2","key":"24_CR16","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":"24_CR17","volume-title":"Selfish Routing and The Price of Anarchy","author":"T Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and The Price of Anarchy. MIT press, Cambridge (2005)"},{"issue":"2","key":"24_CR18","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":"24_CR19","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":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:54:01Z","timestamp":1748714041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}