{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T00:53:46Z","timestamp":1778028826174,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161698","type":"print"},{"value":"9783642161704","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_8","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:07:44Z","timestamp":1286971664000},"page":"78-89","source":"Crossref","is-referenced-by-count":2,"title":["On Nash-Equilibria of Approximation-Stable Games"],"prefix":"10.1007","author":[{"given":"Pranjal","family":"Awasthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria-Florina","family":"Balcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Or","family":"Sheffet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abbott, T.G., Kane, D.M., Valiant, P.: On the complexity of two-player win-lose games. In: Proc. 46th FOCS, pp. 113\u2013122 (2005)","DOI":"10.1109\/SFCS.2005.59"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Blum, A., Gupta, A.: Approximate clustering without the approximation. In: Proc. 20th SODA, pp. 1068\u20131077 (2009)","DOI":"10.1137\/1.9781611973068.116"},{"key":"8_CR3","unstructured":"Balcan, M.F., Braverman, M.: Approximate Nash equilibria under stability conditions (2010) (manuscript)"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/rsa.20199","volume":"31","author":"I. B\u00e1r\u00e1ny","year":"2007","unstructured":"B\u00e1r\u00e1ny, I., Vempala, S., Vetta, A.: Nash equilibria in random games. Random Struct. Algorithms\u00a031(4), 391\u2013405 (2007)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2009.09.023","volume":"411","author":"H. Bosse","year":"2010","unstructured":"Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. Theor. Comput. Sci.\u00a0411(1), 164\u2013173 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proc. 47th FOCS, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput.\u00a039(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.H.: Progress in approximate Nash equilibria. In: Proc. 8th ACM-EC (2007)","DOI":"10.1145\/1250910.1250962"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput.\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Nazerzadeh, H., Saberi, A.: Approximating nash equilibria using small-support strategies. In: Proc.\u00a08th ACM-EC, pp. 352\u2013354 (2007)","DOI":"10.1145\/1250910.1250961"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proc.\u00a04th ACM-EC, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"8_CR12","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.: 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)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:17:11Z","timestamp":1740593831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}