{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:50:52Z","timestamp":1767340252158},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_26","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"286-296","source":"Crossref","is-referenced-by-count":35,"title":["Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games"],"prefix":"10.1007","author":[{"given":"Spyros C.","family":"Kontogiannis","sequence":"first","affiliation":[]},{"given":"Panagiota N.","family":"Panagopoulou","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0024-3795(94)90357-3","volume":"199","author":"I. Alth\u00f6fer","year":"1994","unstructured":"Alth\u00f6fer, I.: On Sparse Approximations to Randomized Strategies and Convex Combinations. Linear Algebra and Applications\u00a0199, 339\u2013355 (1994)","journal-title":"Linear Algebra and Applications"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Barany, I., Vempala, S., Vetta, A.: Nash Equilibria in Random Games. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 123\u2013131 (2005)","DOI":"10.1109\/SFCS.2005.52"},{"key":"26_CR3","unstructured":"Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. Electronic Colloquium on Computational Complexity (ECCC), TR05-140 (2005)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Computing Nash Equilibria: Approximation and Smoothed Complexity. Electronic Colloquium on Computational Complexity (ECCC), TR06-023 (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.: The Complexity of Computing a Nash Equilibrium. Electronic Colloquium on Computational Complexity (ECCC), TR05-115 (2005)","DOI":"10.1145\/1132516.1132527"},{"key":"26_CR6","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":"26_CR7","unstructured":"Daskalakis, C., Papadimitriou, C.: Three-player Games are Hard. Electronic Colloquium on Computational Complexity (ECCC), TR05-139 (2005)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"Lemke, C.E.: Bimatrix Equilibrium Points and Mathematical Programming. Management Science\u00a011, 681\u2013689 (1965)","journal-title":"Management Science"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"Lemke, C.E., Howson, J.T.: Equilibrium Points of Bimatrix Games. J. Soc. Indust. Appl. Math.\u00a012, 413\u2013423 (1964)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing Large Games using Simple Startegies. In: EC 2003: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Noncooperative Games. Annals of Mathematics\u00a054, 289\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On Inefficient Proofs of Existence and Complexity Classes. In: Proceedings of the 4th Czechoslovakian Symposium on Combinatorics (1991)","DOI":"10.1016\/S0167-5060(08)70637-X"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T16:54:01Z","timestamp":1683651241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11944874_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}