{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:25:35Z","timestamp":1709821535650},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00446-014-0223-6","type":"journal-article","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T18:31:40Z","timestamp":1403893900000},"page":"105-125","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Concurrent imitation dynamics in congestion games"],"prefix":"10.1007","volume":"29","author":[{"given":"Heiner","family":"Ackermann","sequence":"first","affiliation":[]},{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,28]]},"reference":[{"issue":"5\u20136","key":"223_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00446-010-0125-1","volume":"23","author":"H Ackermann","year":"2011","unstructured":"Ackermann, H., Fischer, S., Hoefer, M., Sch\u00f6ngens, M.: Distributed algorithms for QoS load balancing. Distrib. Comput. 23(5\u20136), 321\u2013330 (2011)","journal-title":"Distrib. Comput."},{"key":"223_CR2","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"223_CR3","doi-asserted-by":"crossref","unstructured":"Adolphs, C., Berenbrink, P.: Distributed selfish load balancing with weights and speeds. In: Proceedings of the 31st Symposium Principles of Distributed Computing (PODC), pp. 135\u2013144 (2012)","DOI":"10.1145\/2332432.2332460"},{"issue":"1","key":"223_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/070702370","volume":"42","author":"B Awerbuch","year":"2013","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. SIAM J. Comput. 42(1), 160\u2013177 (2013)","journal-title":"SIAM J. Comput."},{"key":"223_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proceedings of the 9th Conference Electronic Commerce (EC), pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"223_CR6","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. SIAM J. Comput. 37(4), 1163\u20131181 (2007)","DOI":"10.1137\/060660345"},{"key":"223_CR7","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Hajirasouliha, I., Hu, Z.: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. Algorithmica 62(3\u20134), 767\u2013786 (2012)","DOI":"10.1007\/s00453-010-9482-1"},{"key":"223_CR8","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Hoefer, M., Sauerwald, T.: Distributed selfish load balancing on networks. In: Proceedings of the 22nd Symposium Discrete Algorithms (SODA), pp. 1487\u20131497 (2011)","DOI":"10.1137\/1.9781611973082.116"},{"issue":"1","key":"223_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4086\/toc.2010.v006a008","volume":"6","author":"A Blum","year":"2010","unstructured":"Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games. Theory Comput. 6(1), 179\u2013199 (2010)","journal-title":"Theory Comput."},{"issue":"2","key":"223_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. Games Econom. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econom. Behav."},{"key":"223_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy in finite congestion games. In: Proceedings of the 37th Symposium Theory of Computing (STOC), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"223_CR12","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria in load balancing. ACM Trans. Algorithms 3(3), (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"223_CR13","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of the 16th Symposium Discrete Algorithms (SODA), pp. 772\u2013781 (2005)"},{"key":"223_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Symposium Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"223_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2229163.2229169","volume":"8","author":"A Fanelli","year":"2012","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8(3), 25 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"223_CR16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00446-011-0145-5","volume":"24","author":"A Fanelli","year":"2011","unstructured":"Fanelli, A., Moscardelli, L.: On best response dynamics in weighted congestion games with polynomial delays. Distrib. Comput. 24(5), 245\u2013254 (2011)","journal-title":"Distrib. Comput."},{"key":"223_CR17","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Moscardelli, L., Skopalik, A.: On the impact of fair best response dynamics. In: Proceedings of the 37th International Symposium on Mathematics Foundations of Computer Science (MFCS), pp. 360\u2013371 (2012)","DOI":"10.1007\/978-3-642-32589-2_33"},{"key":"223_CR18","doi-asserted-by":"crossref","unstructured":"Fischer, S., M\u00e4h\u00f6nen, P., Sch\u00f6ngens, M., V\u00f6cking, B.: Load balancing for dynamic spectrum assignment with local information for secondary users. In: Proceedings of the Symposium on Dynamic Spectrum Access Networks (DySPAN) (2008)","DOI":"10.1109\/DYSPAN.2008.38"},{"issue":"8","key":"223_CR19","doi-asserted-by":"crossref","first-page":"3700","DOI":"10.1137\/090746720","volume":"39","author":"S Fischer","year":"2010","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to Wardrop equilibria by adaptive sampling mehtods. SIAM J. Comput. 39(8), 3700\u20133735 (2010)","journal-title":"SIAM J. Comput."},{"issue":"36","key":"223_CR20","doi-asserted-by":"crossref","first-page":"3357","DOI":"10.1016\/j.tcs.2008.01.055","volume":"410","author":"S Fischer","year":"2008","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive routing with stale information. Theor. Comput. Sci. 410(36), 3357\u20133371 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"223_CR21","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s00224-009-9198-2","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D., Kaporis, A., Spirakis, P.: Atomic congestion games: fast, myopic and concurrent. Theory Comput. Syst. 47(1), 38\u201349 (2010)","journal-title":"Theory Comput. Syst."},{"key":"223_CR22","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4), (2008)","DOI":"10.1145\/1383369.1383383"},{"key":"223_CR23","doi-asserted-by":"crossref","unstructured":"Goldberg, P.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: Proceedings of the 23rd Symposium on Principles of Distributed Computing (PODC), pp. 131\u2013140 (2004)","DOI":"10.1145\/1011767.1011787"},{"key":"223_CR24","doi-asserted-by":"crossref","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 33, 305\u2013308 (1990)","DOI":"10.1016\/0020-0190(90)90214-I"},{"key":"223_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139173179","volume-title":"Evolutionary Games and Population Dynamics","author":"J Hofbauer","year":"1998","unstructured":"Hofbauer, J., Sigmund, K.: Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge (1998)"},{"key":"223_CR26","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th Conference Artificial Intelligence (AAAI), pp. 489\u2013494 (2005)"},{"key":"223_CR27","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Multiplicative updates outperform generic no-regret learning in congestion games. In: Proceedings of the 41st Symposium Theory of Computing (STOC), pp. 533\u2013542 (2009)","DOI":"10.1145\/1536414.1536487"},{"issue":"1","key":"223_CR28","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00446-011-0129-5","volume":"24","author":"R Kleinberg","year":"2011","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Load balancing without regret in the bulletin board model. Distrib. Comput. 24(1), 21\u201329 (2011)","journal-title":"Distrib. Comput."},{"issue":"2","key":"223_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"223_CR30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"223_CR31","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the 41st Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"223_CR32","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 40th Symposium on Theory of Computing (STOC), pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"223_CR33","volume-title":"Algorithmic Game Theory, chapter 20","author":"B V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds.) Algorithmic Game Theory, chapter 20. Cambridge University Press, Cambridge (2007)"},{"key":"223_CR34","volume-title":"Evolutionary Game Theory","author":"J Weibull","year":"1995","unstructured":"Weibull, J.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0223-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0223-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0223-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:45Z","timestamp":1559136405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0223-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,28]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0223-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,28]]}}}