{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:13:07Z","timestamp":1792156387164,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_50","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"572-583","source":"Crossref","is-referenced-by-count":29,"title":["Atomic Congestion Games Among Coalitions"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyros","family":"Kontogiannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th ACM Symp. on Th. of Comp (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of the 37th ACM Symp. on Th. of Comp (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","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.\u00a04052, Springer, Heidelberg (2006)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-25960-2_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Computational complexity, fairness, and the price of anarchy of the maximum latency problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 59\u201373. Springer, Heidelberg (2004)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11496915_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: On the inefficiency of equilibria in congestion games. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 167\u2013181. Springer, Heidelberg (2005)"},{"key":"50_CR6","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. of the 13th ACM-SIAM Symp. on Discr. Alg. (SODA 2002), pp. 413\u2013420 (2002)"},{"key":"50_CR7","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":"50_CR8","first-page":"772","volume-title":"Proc. of the 16th ACM-SIAM Symp. on Discr. Alg. (SODA 2005)","author":"E. Even-Dar","year":"2005","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proc. of the 16th ACM-SIAM Symp. on Discr. Alg (SODA 2005), pp. 772\u2013781. SIAM, Philadelphia (2005)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proc. of the 36th ACM Symp. on Th. of Comp (STOC 2004) (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., Luecking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)"},{"key":"50_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theoretical Computer Science\u00a0348(2-3), 226\u2013239 (2005); Special Issue dedicated to ICALP 2004 (TRACK-A)","journal-title":"Theoretical Computer Science"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_13","volume-title":"Approximation and Online Algorithms","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in network congestion games: Pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, Springer, Heidelberg (2006)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Fotakis D., Kontogiannis S., Spirakis P. Atomic congestion games among coalitions. Technical report, DELIS (2006), accessible via \n                    \n                      http:\/\/delis.upb.de\/docs\/","DOI":"10.1007\/11786986_50"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, E., Wexler, T.: The effect of collusion in congestion games. In: Proc. of the 38th ACM Symp. on Th. of Comp (STOC 2006) (2006) (to appear)","DOI":"10.1145\/1132516.1132529"},{"key":"50_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/11600930_100","volume-title":"Internet and Network Economics","author":"S. Kontogiannis","year":"2005","unstructured":"Kontogiannis, S., Spirakis, P.: Atomic selfish routing in networks: A survey. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 989\u20131002. Springer, Heidelberg (2005)"},{"issue":"6","key":"50_CR17","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003); Special Issue devoted to SIROCCO 2002","journal-title":"Theory of Computing Systems"},{"key":"50_CR18","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)"},{"issue":"4","key":"50_CR19","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":"50_CR20","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. of the 33rd ACM Symp. on Th. of Comp (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"50_CR21","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":"50_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Noncooperative games. Annals of Mathematics\u00a054, 289\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"issue":"5","key":"50_CR23","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 Trans. on Networking\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"50_CR24","unstructured":"Roughgarden, T.: Selfish routing with atomic players. In: Proc. of the 16th ACM-SIAM Symp. on Discr. Alg. (SODA 2005), pp. 973\u2013974 (2005)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:31:47Z","timestamp":1558294307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11786986_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}