{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T09:27:38Z","timestamp":1791106058813,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540793083","type":"print"},{"value":"9783540793090","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_15","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"158-169","source":"Crossref","is-referenced-by-count":4,"title":["Sensitivity of Wardrop Equilibria"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Englert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Franke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Olbrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"15_CR2","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF02612357","volume":"28","author":"S. Dafermos","year":"1984","unstructured":"Dafermos, S., Nagurney, A.: Sensitivity Analysis for the Asymmetric Network Equilibrium Problem. Mathematical Programming\u00a028, 174\u2013184 (1984)","journal-title":"Mathematical Programming"},{"issue":"2","key":"15_CR4","first-page":"91","volume":"73","author":"S. Dafermos","year":"1969","unstructured":"Dafermos, S., Sparrow, F.T.: The Traffic Assignment Problem for a General Network. Journal of Research of the National Bureau of Standards\u00a073(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0191-2615(79)90023-7","volume":"13","author":"C. Fisk","year":"1979","unstructured":"Fisk, C.: More Paradoxes in the Equilibrium Assignment Problem. Transportation Research, Series B\u00a013(4), 305\u2013309 (1979)","journal-title":"Transportation Research, Series B"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.12.3.208","volume":"12","author":"M.A. Hall","year":"1978","unstructured":"Hall, M.A.: Properties of the Equilibrium State in Transportation Networks. Transportation Science\u00a012, 208\u2013216 (1978)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.trb.2005.12.004","volume":"41","author":"M. Josefsson","year":"2007","unstructured":"Josefsson, M., Patriksson, M.: Sensitivity Analysis of Separable Traffic Equilibria with Application to Bilevel Optimization in Network Design. Transportation Research Series B\u00a041(1), 4\u201331 (2007)","journal-title":"Transportation Research Series B"},{"key":"15_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.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"15_CR9","first-page":"258","volume":"38","author":"M. Patriksson","year":"2004","unstructured":"Patriksson, M.: Sensitivity Analysis of Traffic Equilibria. Transportation Research\u00a038, 258\u2013281 (2004)","journal-title":"Transportation Research"},{"key":"15_CR10","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, Basingstoke (1920)"},{"issue":"2","key":"15_CR11","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":"15_CR12","unstructured":"Roughgarden, T.: How Unfair is Selfish Routing. In: Roughgarden, T. (ed.) Proc. of th 13th Annual Symposium on Discrete Algorithms (SODA), pp. 203\u2013204 (2002)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The Price of Anarchy is Independent of the Network Topology. In: Proc. of th 34th Annual Symposium on Theory of Computing Discrete Algorithms (STOC), pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: On the Severity of Braess\u2019s Paradox: Designing Networks for Selfish Users is Hard. Journal of Computer and System Sciences\u00a072(5), 922\u2013953 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proc. of the Institute of Civil Engineers Pt. II, 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-540-79309-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:49:57Z","timestamp":1657561797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}