{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:56:59Z","timestamp":1725537419737},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_22","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"251-262","source":"Crossref","is-referenced-by-count":6,"title":["On the Performance of Approximate Equilibria in Congestion Games"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Heidelberg (2006)"},{"key":"22_CR2","unstructured":"Albers, S.: On the value of coordination in network design. In: SODA, pp. 294\u2013303 (2008)"},{"key":"22_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. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"22_CR5","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: SPAA, pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"22_CR9","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA, pp. 169\u2013178 (2007)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"22_CR12","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. CoRR, abs\/0804.3160 (2008)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","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.\u00a029(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"J.R. Correa","year":"2007","unstructured":"Correa, J.R., Schulz, A.S., Moses, N.E.S.: Fast, fair, and efficient flows in networks. Operations Research\u00a055, 215\u2013225 (2007)","journal-title":"Operations Research"},{"issue":"2","key":"22_CR15","first-page":"91","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, Series B\u00a073B(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards, Series B"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a nash equilibrium. In: STOC, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 297\u2013306. Springer, Heidelberg (2006)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2006","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: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"22_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":"22_CR20","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)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: EC, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"22_CR22","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":"22_CR23","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 and Economics Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economics Behavior"},{"key":"22_CR24","doi-asserted-by":"publisher","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":"22_CR25","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"22_CR26","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":"22_CR27","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? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"22_CR28","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":"22_CR29","unstructured":"Roughgarden, T.: Selfish Routing. PhD. Thesis, Cornell University (May 2002)"},{"key":"22_CR30","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: SODA, pp. 203\u2013204 (2002)"},{"issue":"2","key":"22_CR31","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. J. Comput. Syst. Sci.\u00a067(2), 341\u2013364 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR32","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":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-77105-0_8","volume-title":"Internet and Network Economics","author":"H. Tsaknakis","year":"2007","unstructured":"Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 42\u201356. Springer, Heidelberg (2007)"},{"key":"22_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 II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:09Z","timestamp":1558524129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}