{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:47Z","timestamp":1725491327326},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_20","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"238-252","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Wardrop Equilibria with Finitely Many Agents"],"prefix":"10.1007","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","reference":[{"key":"20_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":"20_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Khandekar, R.: Greedy distributed optimization of multi-commodity flows. In: Proc. 26th Ann. Symp. on Principles of Distributed Computing (PODC) (2007)","DOI":"10.1145\/1281100.1281140"},{"key":"20_CR3","unstructured":"Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: Proc. 18th Ann. Symp. on Discrete Algorithms (SODA) (2007)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In: Proc. 36th Ann. Symp. on Theory of Comput. (STOC), pp. 45\u201353 (2004)","DOI":"10.1145\/1007352.1007367"},{"key":"20_CR5","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven and London (1956)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proc. 17th Ann. Symp. on Discrete Algorithms (SODA) (2006)","DOI":"10.1145\/1109557.1109597"},{"key":"20_CR7","unstructured":"Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific (1998)"},{"key":"20_CR8","first-page":"45","volume-title":"Proc. 25th Ann. Symp. on Principles of Distributed Computing (PODC)","author":"A. Blum","year":"2006","unstructured":"Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proc. 25th Ann. Symp. on Principles of Distributed Computing (PODC), pp. 45\u201352. ACM, New York (2006)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th Conf. on Electronic Commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11786986_46","volume-title":"Automata, Languages and Programming","author":"R. Cominetti","year":"2006","unstructured":"Cominetti, R., Correa, J.R., Moses, N.E.S.: Network games with atomic players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 525\u2013536. Springer, Heidelberg (2006)"},{"key":"20_CR11","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proc. 16th Ann. Symp. on Discrete Algorithms (SODA), pp. 772\u2013781 (2005)"},{"key":"20_CR12","first-page":"653","volume-title":"Proc. 38th Symposium on Theory of Computing (STOC)","author":"S. Fischer","year":"2006","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proc. 38th Symposium on Theory of Computing (STOC), pp. 653\u2013662. ACM, New York (2006)"},{"key":"20_CR13","first-page":"276","volume-title":"Proc. 24th Symp. on Principles of Distributed Computing (PODC)","author":"S. Fischer","year":"2005","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive routing with stale information. In: Aguilera, M.K., Aspnes, J. (eds.) Proc. 24th Symp. on Principles of Distributed Computing (PODC), pp. 276\u2013283. ACM, New York (2005)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/978-3-540-27836-8_47","volume-title":"Automata, Languages and Programming","author":"L. Fleischer","year":"2004","unstructured":"Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 544\u2013554. Springer, Heidelberg (2004)"},{"key":"20_CR15","first-page":"131","volume-title":"Proc. 23rd Symp. on Principles of Distributed Computing (PODC)","author":"P.W. Goldberg","year":"2004","unstructured":"Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer, load-balancing game. In: Proc. 23rd Symp. on Principles of Distributed Computing (PODC), pp. 131\u2013140. ACM, New York (2004)"},{"key":"20_CR16","doi-asserted-by":"publisher","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. Information Processing Letters\u00a033, 305\u2013308 (1990)","journal-title":"Information Processing Letters"},{"key":"20_CR17","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proc. 13th Ann. Symp. on Discrete Algorithms (SODA), pp. 203\u2013204 (2002)"},{"issue":"2","key":"20_CR18","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? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"20_CR19","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, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:38Z","timestamp":1619520758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}