{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:11Z","timestamp":1763467871981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"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_12","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"121-132","source":"Crossref","is-referenced-by-count":11,"title":["Atomic Congestion Games: Fast, Myopic and Concurrent"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"given":"Alexis C.","family":"Kaporis","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., Roeglin, H., Voecking, B.: On the impact of combinatorial structure on congestion games. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"12_CR2","unstructured":"Arndt, H.: Load balancing: dimension exchange on product graphs. In: 18th International Symposium on Parallel and Distributed Processing (2004)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: STOC (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: SODA (2006)","DOI":"10.1145\/1109557.1109597"},{"key":"12_CR5","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: PODC (2006)","DOI":"10.1145\/1146381.1146392"},{"key":"12_CR6","unstructured":"Chien, S., Sinclair, A.: Convergece to Approximate Nash Equilibria in Congestion Games. In: SODA (2007)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: STOC (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11672142_28","volume-title":"STACS 2006","author":"G. Christodoulou","year":"2006","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 349\u2013360. Springer, Heidelberg (2006)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput.\u00a07, 279\u2013301 (1989)","journal-title":"J. Parallel Distrib. Comput."},{"key":"12_CR10","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: SODA (2005)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash Equilibria. In: STOC (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to wardrop equilibria by adaptive sampling methods. In: STOC (2006)","DOI":"10.1145\/1132516.1132608"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. In: TCS, vol.\u00a0348, pp. 226\u2013239 (2005)","DOI":"10.1016\/j.tcs.2005.09.024"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/11786986_50","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic Congestion Games among Coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 572\u2013583. Springer, Heidelberg (2006)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Ghosh, B., Muthukrishnan, S.: Dynamic load balancing in parallel and distributed networks by random matchings. In: SPAA (1994)","DOI":"10.1145\/181014.181366"},{"key":"12_CR17","unstructured":"Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS 2005 (2005)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: PODC (2004)","DOI":"10.1145\/1011767.1011787"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: The Effect of Collusion in Congestion Games. In: STOC (2006)","DOI":"10.1145\/1132516.1132529"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0743-7315(90)90025-K","volume":"10","author":"S.H. Hosseini","year":"1990","unstructured":"Hosseini, S.H., Litow, B., Malkawi, M.I., McPherson, J., Vairavan, K.: Analysis of a graph coloring based distributed load balancing algorithm.. J. Par. Distr. Comp.\u00a010, 160\u2013166 (1990)","journal-title":"J. Par. Distr. Comp."},{"key":"12_CR21","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: AAAI (2005)"},{"issue":"4","key":"12_CR22","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":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-27821-4_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V. Mirrokni","year":"2004","unstructured":"Mirrokni, V., Vetta, A.: Convergence Issues in Competitive Games. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 183\u2013194. Springer, Heidelberg (2004)"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games& Econ. Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games& Econ. Behavior"},{"key":"12_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"5","key":"12_CR26","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 multiuser communication networks. IEEE\/ACM Trans. on Net.\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. on Net."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"12_CR28","unstructured":"Sandholm, W.H.: Population Games and Evolutionary Dynamics. MIT Press (to be published), \n                      http:\/\/www.ssc.wisc.edu\/~whs\/book\/index.html"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1006\/jeth.2000.2696","volume":"97","author":"W.H. Sandholm","year":"2001","unstructured":"Sandholm, W.H.: Potential Games with Continuous Player Sets. Journal of Economic Theory\u00a097, 81\u2013108 (2001)","journal-title":"Journal of Economic Theory"},{"key":"12_CR30","unstructured":"Extended version. \n                      http:\/\/students.ceid.upatras.gr\/~kaporis\/papers\/fks-sagt-08.pdf"},{"key":"12_CR31","volume-title":"Evolutionary Game Theory","author":"J.W. Weibull","year":"1995","unstructured":"Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:49:44Z","timestamp":1657561784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}