{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:22:57Z","timestamp":1743121377131,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_11","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"129-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games"],"prefix":"10.1007","author":[{"given":"Pieter","family":"Kleer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"11_CR1","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":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10107-015-0889-y","volume":"151","author":"R Cominetti","year":"2015","unstructured":"Cominetti, R.: Equilibrium routing under uncertainty. Math. Program. 151(1), 117\u2013151 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","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 Econ. Behav. 64(2), 457\u2013469 (2008)","journal-title":"Games Econ. Behav."},{"key":"11_CR4","unstructured":"Kleer, P., Sch\u00e4fer, G.: The impact of worst-case deviations in non-atomic network routing games (2016). CoRR, abs\/1605.01510"},{"key":"11_CR5","unstructured":"Lianeas, T., Nikolova, E., Stier-Moses, N.E.: Asymptotically tight bounds for inefficiency in risk-averse selfish routing (2015). CoRR, abs\/1510.02067"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/090769600","volume":"25","author":"H Lin","year":"2011","unstructured":"Lin, H., Roughgarden, T., Tardos, \u00c9., Walkover, A.: Stronger bounds on Braess\u2019s paradox and the maximum latency of selfish routing. SIAM J. Discrete Math. 25(4), 1667\u20131686 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/2847220.2847242","volume":"43","author":"R Meir","year":"2015","unstructured":"Meir, R., Parkes, D.: Playing the wrong game: Smoothness bounds for congestion games with behavioral biases. SIGMETRICS Perform. Eval. Rev. 43(3), 67\u201370 (2015)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.2013.1246","volume":"62","author":"E Nikolova","year":"2014","unstructured":"Nikolova, E., Stier-Moses, N.E.: A mean-risk model for the traffic assignment problem with stochastic travel times. Oper. Res. 62(2), 366\u2013382 (2014)","journal-title":"Oper. Res."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Nikolova, E., Stier-Moses, N.E.: The burden of risk aversion in mean-risk selfish routing. In: Proceedings of the ACM Conference on Economics and Computation, pp. 489\u2013506 (2015)","DOI":"10.1145\/2764468.2764485"},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of Braess\u2019s paradox: Designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5), 922\u2013953 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 32 (2015)","journal-title":"J. ACM"},{"key":"11_CR12","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civil Eng. 1, 325\u2013378 (1952)","journal-title":"Proc. Inst. Civil Eng."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:01:56Z","timestamp":1558314116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}