{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:05:57Z","timestamp":1743044757387,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851936"},{"type":"electronic","value":"9783540851943"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85194-3_5","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T06:21:05Z","timestamp":1219126865000},"page":"19-32","source":"Crossref","is-referenced-by-count":10,"title":["Distributed Learning of Wardrop Equilibria"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Bournez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Octave","family":"Boussaton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanne","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Altman, E., Hayel, Y., Kameda, H.: Evolutionary Dynamics and Potential Games in Non-Cooperative Routing. In: Wireless Networks: Communication, Cooperation and Competition (WNC3 2007) (2007)","key":"5_CR1","DOI":"10.1109\/WIOPT.2007.4480096"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1145\/1109557.1109597","volume-title":"SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed Selfish Load Balancing. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 354\u2013363. ACM, New York (2006)"},{"unstructured":"Bournez, O.: Mod\u00e8les Continus. Calculs. Algorithmique Distribu\u00e9e. Hdr, Institut National Polytechnique de Lorraine (D\u00e9cember 7, 2006)","key":"5_CR3"},{"key":"5_CR4","first-page":"383","volume-title":"New Computational Paradigms. Changing Conceptions of What is Computable","author":"O. Bournez","year":"2008","unstructured":"Bournez, O., Campagnolo, M.L.: A Survey on Continuous Time Computations. In: New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, New York (2008)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jco.2006.12.005","volume":"23","author":"O. Bournez","year":"2007","unstructured":"Bournez, O., Campagnolo, M.L., Gra\u00e7a, D.S., Hainry, E.: Polynomial Differential Equations Compute All Real Computable Functions on Computable Compact Intervals. Journal of Complexity\u00a023(3), 317\u2013335 (2007)","journal-title":"Journal of Complexity"},{"issue":"4","key":"5_CR6","first-page":"409","volume":"74","author":"O. Bournez","year":"2006","unstructured":"Bournez, O., Hainry, E.: Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundinform\u00a074(4), 409\u2013433 (2006)","journal-title":"Fundinform"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/779928.779941","volume-title":"Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003)","author":"R. Cole","year":"2003","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Low much can taxes help selfish routing? In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 98\u2013107. ACM Press, New York (2003)"},{"key":"5_CR8","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., Stier-Moses, N.E.: Network Games with Atomic Players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 525\u2013536. Springer, Heidelberg (2006)"},{"unstructured":"Demailly, J.-P.: Analyse Num\u00e9rique et Equations Diff\u00e9rentielles. Presses Universitaires de Grenoble (1991)","key":"5_CR9"},{"doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: 30th International Conference on Automata, Languages and Programming (ICALP), pp. 502\u2013513 (2003)","key":"5_CR10","DOI":"10.1007\/3-540-45061-0_41"},{"doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash equilibrium in Load Balancing. ACM Transactions on Algorithms\u00a03(3) (2007)","key":"5_CR11","DOI":"10.1145\/1273340.1273348"},{"unstructured":"Even-Dar, E., Mansour, Y.: Fast Convergence of Selfish Rerouting. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 772\u2013781 (2005)","key":"5_CR12"},{"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 the thirty-eighth annual ACM symposium on Theory of computing, pp. 653\u2013662 (2006)","key":"5_CR13","DOI":"10.1145\/1132516.1132608"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms \u2013 ESA 2004","author":"S. Fischer","year":"2004","unstructured":"Fischer, S., Vocking, B.: On the Evolution of Selfish Routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive Routing with Stale Information. In: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 276\u2013283 (2005)","key":"5_CR15","DOI":"10.1145\/1073814.1073868"},{"issue":"2-3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"L. Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear Tolls Suffice: New Bounds and Algorithms For Tolls in Single Source Networks. Theoretical Computer Science\u00a0348(2-3), 217\u2013225 (2005)","journal-title":"Theoretical Computer Science"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1011767.1011787","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","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: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 131\u2013140. ACM, New York (2004)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/game.1997.0582","volume":"22","author":"C. Harris","year":"1998","unstructured":"Harris, C.: On the Rate of Convergence of Continuous-Time Fictitious Play. Games and Economic Behavior\u00a022(2), 238\u2013259 (1998)","journal-title":"Games and Economic Behavior"},{"key":"5_CR19","volume-title":"Differential Equations, Dynamical Systems, and an Introduction to Chaos","author":"M.W. Hirsch","year":"2003","unstructured":"Hirsch, M.W., Smale, S., Devaney, R.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Elsevier Academic Press, Amsterdam (2003)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1090\/S0273-0979-03-00988-1","volume":"4","author":"J. Hofbauer","year":"2003","unstructured":"Hofbauer, J., Sigmund, K.: Evolutionary Game Dynamics. Bulletin of the American Mathematical Society\u00a04, 479\u2013519 (2003)","journal-title":"Bulletin of the American Mathematical Society"},{"doi-asserted-by":"crossref","unstructured":"Hofbauer, J., Sorin, S.: Best Response Dynamics for Continuous Zero-Sum Games. Discrete and Continuous Dynamical Systems-Series B\u00a06(1) (2006)","key":"5_CR21","DOI":"10.3934\/dcdsb.2006.6.215"},{"key":"5_CR22","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":"5_CR23","volume-title":"Learning Automata: An Introduction","author":"M.A.L. Thathachar","year":"1989","unstructured":"Thathachar, M.A.L., Narendra, K.S.: Learning Automata: An Introduction. Prentice Hall, Englewood Cliffs (1989)"},{"key":"5_CR24","volume-title":"Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory","author":"H.J. Kushner","year":"1984","unstructured":"Kushner, H.J.: Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory. MIT Press, Cambridge (1984)"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L. Libman","year":"2001","unstructured":"Libman, L., Orda, A.: Atomic Resource Sharing in Noncooperative Networks. Telecommunication Systems\u00a017(4), 385\u2013409 (2001)","journal-title":"Telecommunication Systems"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium Points in n-person Games. Proc. of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proc. of the National Academy of Sciences"},{"issue":"5","key":"5_CR27","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A. Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive Routing in Multi-user Communication Networks. IEEE\/ACM Transactions on Networking (TON)\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"doi-asserted-by":"crossref","unstructured":"Thathachar, M.A.L., Sastry, P.S., Phansalkar, V.V.: Decentralized Learning of Nash Equilibria in Multi-Person Stochastic Games With Incomplete Information. IEEE transactions on system, man, and cybernetics\u00a024(5) (1994)","key":"5_CR28","DOI":"10.1109\/21.293490"},{"unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 203\u2013204 (2002)","key":"5_CR29"},{"issue":"2","key":"5_CR30","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":"5_CR31","series-title":"Lecture Notes in Computer Science","first-page":"238","volume-title":"Distributed Computing","author":"L. Olbrich","year":"2007","unstructured":"Olbrich, L., Fischer, S., V\u00f6cking, B.: Approximating Wardrop Equilibria with Finitely Many Agents. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 238\u2013252. Springer, Heidelberg (2007)"},{"key":"5_CR32","volume-title":"Multidimensional Diffusion Processes","author":"D.W. Stroock","year":"1979","unstructured":"Stroock, D.W., Varadhan, S.R.S.: Multidimensional Diffusion Processes. Springer, Heidelberg (1979)"},{"key":"5_CR33","volume-title":"Algorithmic Game Theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish Load Balancing. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"36","key":"5_CR34","first-page":"352","volume":"1","author":"J. Wardrop","year":"1952","unstructured":"Wardrop, J.: Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institution of Civil Engineers, Part II\u00a01(36), 352\u2013362 (1952)","journal-title":"Proceedings of the Institution of Civil Engineers, Part II"},{"key":"5_CR35","volume-title":"Evolutionary Game Theory","author":"J.W. Weibull","year":"1995","unstructured":"Weibull, J.W.: Evolutionary Game Theory. The MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85194-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T04:05:26Z","timestamp":1715400326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85194-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540851936","9783540851943"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85194-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}