{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:34:48Z","timestamp":1743107688322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_17","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"212-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Path Deviations Outperform Approximate Stability in Heterogeneous Congestion 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":[[2017,8,19]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2597893","volume":"2","author":"Po-An Chen","year":"2014","unstructured":"Chen, P.-A., Keijzer, B.D., Kempe, D., Sch\u00e4fer, G.: Altruism and its impact on the price of anarchy. ACM Trans. Econ. Comput. 2(4), 17:1\u201317:45 (2014)","journal-title":"ACM Transactions on Economics and Computation"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"George Christodoulou","year":"2010","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-79309-0_15","volume-title":"Algorithmic Game Theory","author":"M Englert","year":"2008","unstructured":"Englert, M., Franke, T., Olbrich, L.: Sensitivity of Wardrop equilibria. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 158\u2013169. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-79309-0_15"},{"issue":"2-3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"Lisa Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear tolls suffice: new bounds and algorithms for tolls in single source networks. Theoret. Comput. Sci. 348(2), 217\u2013225 (2005)","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","unstructured":"Fujishige, S., Goemans, M.X., Harks, T., Peis, B., Zenklusen, R.: Matroids are immune to braess paradox. CoRR, abs\/1504.07545 (2015)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Kleer, P., Sch\u00e4fer, G.: The impact of worst-case deviations in non-atomic network routing games. CoRR, abs\/1605.01510 (2016)","DOI":"10.1007\/978-3-662-53354-3_11"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kleer, P., Sch\u00e4fer, G.: Path deviations outperform approximate stability in heterogeneous congestion games. CoRR, abs\/1707.01278 (2017)","DOI":"10.1007\/978-3-319-66700-3_17"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/3-540-49116-3_38"},{"key":"17_CR9","unstructured":"Lianeas, T., Nikolova, E., Stier-Moses, N.E.: Asymptotically tight bounds for inefficiency in risk-averse selfish routing. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. IJCAI 2016, NY, USA, New York, pp. 338\u2013344 (2016)"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/090769600","volume":"25","author":"Henry 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 Journal on Discrete Mathematics"},{"key":"17_CR11","unstructured":"Meir, R., Parkes, D.C.: Playing the wrong game: smoothness bounds for congestion games with risk averse agents. CoRR, abs\/1411.1751 (2017)"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"Igal Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Games and Economic Behavior"},{"key":"17_CR13","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 Sixteenth ACM Conference on Economics and Computation, EC 2015, pp. 489\u2013506. ACM, New York (2015)","DOI":"10.1145\/2764468.2764485"},{"issue":"5","key":"17_CR14","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"Tim 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":"Journal of Computer and System Sciences"},{"issue":"5","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2806883","volume":"62","author":"Tim Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 32 (2015)","journal-title":"Journal of the ACM"},{"key":"17_CR16","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency Vol. B Matroids Trees Stable Sets Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency Vol. B Matroids Trees Stable Sets Algorithms and Combinatorics. Springer, Heidelberg (2003). Chaps. 39\u201369"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institution of Civil Engineers, vol. 1, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:27:13Z","timestamp":1709828833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","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":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}