{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:05Z","timestamp":1767339785344},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_27","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"297-306","source":"Crossref","is-referenced-by-count":55,"title":["A Note on Approximate Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Constantinos","family":"Daskalakis","sequence":"first","affiliation":[]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Althofer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 199 (1994)","DOI":"10.1016\/0024-3795(94)90357-3"},{"key":"27_CR2","unstructured":"Caccetta, L., Haggkvist, R.: On minimal digraphs with given girth. Congressus Numerantium XXI (1978)"},{"key":"27_CR3","unstructured":"Charbit, P.: Circuits in graphs and digraphs via embeddings. Doctoral dissertation, University of Lyon I (2005)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Computing nash equilibria:approximation and smoothed complexity. In: ECCC (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: STOC (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: STOC (2006)","DOI":"10.1145\/1132516.1132526"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. ACM Electronic Commerce (2003)","DOI":"10.1145\/779928.779933"},{"key":"27_CR9","unstructured":"Myers, J.S.: Extremal theory of graph minors and directed graphs. Doctoral dissertation (2003)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_26","volume-title":"Internet and Network Economics","author":"S.C. Kontogiannis","year":"2006","unstructured":"Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: WINE 2006. LNCS, vol.\u00a04286. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:56Z","timestamp":1619493476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11944874_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}