{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:08:20Z","timestamp":1787497700112,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_28","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"349-360","source":"Crossref","is-referenced-by-count":53,"title":["Convergence and Approximation in Potential Games"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anastasios","family":"Sidiropoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","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":"28_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning\u00a056, 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"28_CR3","unstructured":"Charikar, M., Wirth, A.: Maximizing quadratic programs: extending Grothendieck\u2019s inequality. In: FOCS (page to appear, 2004)"},{"key":"28_CR4","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":"28_CR5","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":"28_CR6","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":"28_CR7","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":"28_CR8","unstructured":"Fliescher, L., Goemans, M., Mirrokni, V.S., Sviridenko, M. (almost) tight approximation algorithms for maximizing general assignment problems(submitted, 2004)"},{"key":"28_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., Spirakis, P.: Selfish unsplittable flow. 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":"28_CR10","doi-asserted-by":"crossref","unstructured":"Goemans, M., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: MOBIHOC (2004)","DOI":"10.1145\/989459.989467"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Goemans, M., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS (2005)","DOI":"10.1109\/SFCS.2005.68"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. Johnson","year":"1988","unstructured":"Johnson, D., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Computer and System Sciences\u00a037, 79\u2013100 (1988)","journal-title":"J. Computer and System Sciences"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Vetta, A.: Convergence issues in competitive games. In: RANDOM-APPROX, pp. 183\u2013194 (2004)","DOI":"10.1007\/978-3-540-27821-4_17"},{"key":"28_CR15","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":"28_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the Internet. In: STOC (2001)","DOI":"10.1145\/380752.380883"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1137\/S0097539793245350","volume":"24","author":"S. Poljak","year":"1995","unstructured":"Poljak, S.: Integer linear programs and local search for max-cut. Siam Journal of Computing\u00a024(4), 822\u2013839 (1995)","journal-title":"Siam Journal of Computing"},{"key":"28_CR18","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":"28_CR19","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"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"T\u00f3th, C.D., Suri, S., Zhou, Y.: Selfish load balancing and atomic congestion games. In: SPAA, pp. 188\u2013195 (2004)","DOI":"10.1145\/1007912.1007941"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-30183-7_12","volume-title":"Peer-to-Peer Systems III","author":"C.D. T\u00f3th","year":"2005","unstructured":"T\u00f3th, C.D., Suri, S., Zhou, Y.: Uncoordinated load balancing and congestion games in p2p systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 123\u2013130. Springer, Heidelberg (2005)"},{"issue":"1","key":"28_CR22","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A. Schaffer","year":"1991","unstructured":"Schaffer, A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM journal on Computing\u00a020(1), 56\u201387 (1991)","journal-title":"SIAM journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T16:55:13Z","timestamp":1736268913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11672142_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}