{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:04:54Z","timestamp":1762160694911},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T00:00:00Z","timestamp":1205366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00446-008-0057-1","type":"journal-article","created":{"date-parts":[[2008,3,12]],"date-time":"2008-03-12T08:30:33Z","timestamp":1205310633000},"page":"129-139","source":"Crossref","is-referenced-by-count":11,"title":["Approximating Wardrop equilibria with finitely many agents"],"prefix":"10.1007","volume":"21","author":[{"given":"Simon","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Olbrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,13]]},"reference":[{"key":"57_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentince-Hall, Englewood Cliffs (1993)"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Khandekar, R.: Greedy distributed optimization of multi-commodity flows. In: Proceedings of 26th Annual Symposium on Principles of Distributed Computing (PODC) (2007)","DOI":"10.1145\/1281100.1281140"},{"key":"57_CR3","unstructured":"Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: Proceedings of 18th Annual Symposium on Discrete Algorithms (SODA) (2007)"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In: Proceedings of 36th Annual Symposium on Theory of Computation (STOC), pp. 45\u201353 (2004)","DOI":"10.1145\/1007352.1007367"},{"key":"57_CR5","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., Bart McGuire, C., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proceedings of 17th Annual Symposium on Discrete Algorithms (SODA) (2006)","DOI":"10.1145\/1109557.1109597"},{"key":"57_CR7","volume-title":"Network Optimization: Continuous and Discrete Models","author":"D.P. Bertsekas","year":"1998","unstructured":"Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (1998)"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proceedings of 25th Annual Symposium on Principles of Distributed Computing (PODC), pp. 45\u201352. ACM, Denver, Colorado (2006)","DOI":"10.1145\/1146381.1146392"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of 4th ACM Conference on Electronic Commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Cominetti, R., Correa, J.R., Stier Moses, N.E.: Network games with atomic players. In: Proceedings of 33rd International EATCS Coll. on Automata, Languages and Programming (ICALP), pp. 525\u2013536 (2006)","DOI":"10.1007\/11786986_46"},{"key":"57_CR11","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of 16th Annual Symposium on Discrete Algorithms (SODA), pp. 772\u2013781 (2005)"},{"key":"57_CR12","unstructured":"Fischer, S.: Dynamic selfish routing. PhD Thesis, Lehrstuhl f\u00fcr Algorithmen und Komplexit\u00e4t, RWTH Aachen (2007)"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proceedings of 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 653\u2013662. ACM, Seattle (2006)","DOI":"10.1145\/1132516.1132608"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive routing with stale information. In: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 276\u2013283. ACM, Las Vegas (2005)","DOI":"10.1145\/1073814.1073868"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Fleischer, L.: Linear tolls suffice: new bounds and algorithms for tolls in single source networks. In: Proceedings of 31st International EATCS Coll. on Automata, Languages and Programming (ICALP), pp. 544\u2013554 (2004)","DOI":"10.1007\/978-3-540-27836-8_47"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer, load-balancing game. In: Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC), pp. 131\u2013140. ACM (2004)","DOI":"10.1145\/1011767.1011787"},{"key":"57_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 33, 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"key":"57_CR18","unstructured":"Ochel, M.: Effiziente Algorithmen f\u00fcr Gleichgewichtsfl\u00fcsse. Master\u2019s Thesis, RWTH Aachen (2007)"},{"key":"57_CR19","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proceedings of 13th Annual Symposium on Discrete Algorithms (SODA), pp. 203\u2013204 (2002)"},{"issue":"2","key":"57_CR20","doi-asserted-by":"crossref","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?. J ACM 49(2), 236\u2013259 (2002)","journal-title":"J ACM"},{"key":"57_CR21","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0057-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0057-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0057-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:37Z","timestamp":1559121997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0057-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,13]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0057-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,13]]}}}