{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:48:27Z","timestamp":1772714907325,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T00:00:00Z","timestamp":1284508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00453-010-9449-2","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T19:49:19Z","timestamp":1284493759000},"page":"116-140","source":"Crossref","is-referenced-by-count":40,"title":["On the Performance of Approximate Equilibria in\u00a0Congestion Games"],"prefix":"10.1007","volume":"61","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,15]]},"reference":[{"key":"9449_CR1","doi-asserted-by":"crossref","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: STACS, pp.\u00a0218\u2013229 (2006)","DOI":"10.1007\/11672142_17"},{"key":"9449_CR2","unstructured":"Albers, S.: On the value of coordination in network design. In: SODA, pp.\u00a0294\u2013303 (2008)"},{"key":"9449_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS, pp.\u00a0295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"9449_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC, pp.\u00a057\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"9449_CR5","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"9449_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: ICALP, pp.\u00a0311\u2013322 (2006)","DOI":"10.1007\/11786986_28"},{"key":"9449_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: FOCS, pp.\u00a0261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"9449_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: SPAA, pp.\u00a029\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"9449_CR9","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: SODA, pp.\u00a0169\u2013178 (2007)"},{"key":"9449_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: ESA, pp.\u00a059\u201370 (2005)","DOI":"10.1007\/11561071_8"},{"key":"9449_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: STOC, pp.\u00a067\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9449_CR12","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. In: CoRR (2008). 0804.3160"},{"issue":"4","key":"9449_CR13","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9449_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"J.R. Correa","year":"2007","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Fast, fair, and efficient flows in networks. Oper. Res. 55, 215\u2013225 (2007)","journal-title":"Oper. Res."},{"issue":"2","key":"9449_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J.\u00a0Res. Natl. Bur. Stand. Ser. B 73B(2), 91\u2013118 (1969)","journal-title":"J.\u00a0Res. Natl. Bur. Stand. Ser. B"},{"key":"9449_CR16","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: STOC, pp.\u00a071\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"9449_CR17","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.H.: A note on approximate Nash equilibria. In: WINE (2006)","DOI":"10.1007\/11944874_27"},{"key":"9449_CR18","doi-asserted-by":"crossref","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: ICALP (1), pp.\u00a0608\u2013618 (2006)","DOI":"10.1007\/11786986_53"},{"key":"9449_CR19","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: On the complexity of pure equilibria. In: STOC (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"9449_CR20","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: STACS, pp.\u00a0404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9449_CR21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: EC, pp.\u00a036\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"9449_CR22","doi-asserted-by":"crossref","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 Econ. Behav. 13, 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"9449_CR23","doi-asserted-by":"crossref","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. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"9449_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"9449_CR25","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: STOC, pp.\u00a0749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9449_CR26","doi-asserted-by":"crossref","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"9449_CR27","first-page":"236","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J.\u00a0ACM 49(2), 236\u2013259 (2002)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9449_CR28","doi-asserted-by":"crossref","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 Econ. Behav. 47(2), 389\u2013403 (2004)","journal-title":"Games Econ. Behav."},{"key":"9449_CR29","unstructured":"Roughgarden, T.: Selfish routing. Ph.D. Thesis, Cornell University, May 2002"},{"key":"9449_CR30","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: SODA, pp.\u00a0203\u2013204 (2002)"},{"key":"9449_CR31","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"9449_CR32","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: STOC, pp.\u00a0355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"9449_CR33","unstructured":"Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: WINE, pp.\u00a047\u201356 (2007)"},{"key":"9449_CR34","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part\u00a0II, vol.\u00a01, pp.\u00a0325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9449-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9449-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9449-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:44:06Z","timestamp":1740516246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9449-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,15]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9449-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,15]]}}}