{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:38Z","timestamp":1760202518818},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_8","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:46:24Z","timestamp":1128588384000},"page":"59-70","source":"Crossref","is-referenced-by-count":84,"title":["On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R. Aumann","year":"1974","unstructured":"Aumann, R.: Subjectivity and correlation in randomized games. Journal of Mathematical Economics\u00a01, 67\u201396 (1974)","journal-title":"Journal of Mathematical Economics"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: 37th Annual ACM STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: 45th Annual IEEE FOCS, pp. 59\u201373 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: 37th Annual ACM STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"8_CR5","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., Moses, N.S.: 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":"8_CR6","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proceedings on 34th Annual ACM STOC, pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"8_CR7","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-case Equilibria. In: Proceedings of the 13th Annual ACM-SIAM SODA, January 2002, pp. 413\u2013420 (2002)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Tulwar, K.: On the complexity of pure equilibria. In: Proceedings of the 36th Annual ACM STOC, June 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S.C., Spirakis, P.G.: Selfish Unsplittable Flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-28629-5_44","volume-title":"Mathematical Foundations of Computer Science 2004","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The Price of Anarchy for Polynomial Social Cost. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 574\u2013585. Springer, Heidelberg (2004)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM STOC, pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"key":"8_CR13","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proceedings of the 9th SIROCCO (2002)"},{"key":"8_CR14","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.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A New Model for Selfish Routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proceedings on 33rd Annual ACM STOC, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"8_CR18","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.S.: Potential Games. Games and and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and and Economic Behavior"},{"key":"8_CR19","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proceedings of the 33rd Annual ACM STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Computing Correlated Equilibria in Multiplayer Games. In: 37th Annual ACM STOC, pp. 49\u201356 (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing Equilibria in Multi-Player Games. In: Proceedings of the 16th Annual ACM-SIAM SODA, pp. 82\u201391 (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"8_CR23","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"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences\u00a067(2), 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR25","unstructured":"Roughgarden, T.: The maximum latency of selfish routing. In: Proceedings of the 15th Annual ACM-SIAM SODA, pp. 980\u2013981 (2004)"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, E.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior\u00a047(2), 389\u2013403 (2004)","journal-title":"Games and Economic Behavior"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proceedings of the 16th annual ACM SPAA, pp. 188\u2013195 (2004)","DOI":"10.1145\/1007912.1007941"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:50:52Z","timestamp":1605624652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11561071_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}