{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:12:17Z","timestamp":1725804737888},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448021"},{"type":"electronic","value":"9783662448038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44803-8_5","type":"book-chapter","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T09:45:22Z","timestamp":1409910322000},"page":"49-60","source":"Crossref","is-referenced-by-count":3,"title":["Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Fanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proceedings of the 9th ACM Conference on Electronic Commerce (EC), pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/110821317","volume":"42","author":"M.-F. Balcan","year":"2013","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Circumventing the price of anarchy: leading dynamics to good behavior. SIAM Journal on Computing\u00a042(1), 230\u2013264 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure Nash equilibrium in cut, party affiliation, and satisfiability games. In: Proceedings of the 11th ACM Conference on Electronic Commerce (EC), pp. 73\u201382 (2010)","DOI":"10.1145\/1807342.1807353"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 532\u2013541 (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 284\u2013301 (2012)","DOI":"10.1145\/2229012.2229036"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S. Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. Games and Economic Behavior\u00a071(2), 315\u2013327 (2011)","journal-title":"Games and Economic Behavior"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G. Christodoulou","year":"2012","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theoretical Computer Science\u00a0438, 13\u201327 (2012)","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum sut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. Hastad","year":"2001","unstructured":"Hastad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037, 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-61422-2_123","volume-title":"Algorithm Theory - SWAT \u201996","author":"H. Klauck","year":"1996","unstructured":"Klauck, H.: On the hardness of global and local approximation. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 88\u201399. Springer, Heidelberg (1996)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Krentel, M.W.: Structure in locally optimal solutions. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 216\u2013221 (1989)","DOI":"10.1109\/SFCS.1989.63481"},{"key":"5_CR14","unstructured":"Michiels, W., Aarts, E., Korst, J.: Theoretical aspects of local search. In: EATCS Monographs in Theoretical Computer Science. Springer (2007)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/S0097539703431007","volume":"33","author":"J.B. Orlin","year":"2004","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. SIAM Journal on Computing\u00a033, 1201\u20131214 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Piliouras, G., Nikolova, E., Shamma, J.S.: Risk sensitivity of price of anarchy under uncertainty. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 715\u2013732 (2013)","DOI":"10.1145\/2492002.2482578"},{"key":"5_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 on Computing\u00a024, 822\u2013839 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"5_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"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing\u00a020, 56\u201387 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44803-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:03:33Z","timestamp":1558973013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44803-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448021","9783662448038"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44803-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}