{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:14:18Z","timestamp":1792156458656,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771043","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_6","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:59:37Z","timestamp":1196647177000},"page":"17-29","source":"Crossref","is-referenced-by-count":24,"title":["New Algorithms for Approximate Nash Equilibria in Bimatrix Games"],"prefix":"10.1007","author":[{"given":"Hartwig","family":"Bosse","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaroslaw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evangelos","family":"Markakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_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":"6_CR2","first-page":"261","volume-title":"Annual IEEE Symposium on Foundations of Computer Science","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 261\u2013272. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"6_CR3","first-page":"603","volume-title":"Annual IEEE Symposium on Foundations of Computer Science","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X., Teng, S.: Computing Nash equilibria: Approximation and smoothed complexity. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"6_CR4","first-page":"71","volume-title":"Annual ACM Symposium on Theory of Computing","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Annual ACM Symposium on Theory of Computing, pp. 71\u201378. ACM Press, New York (2006)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Workshop on Internet and Network Economics, pp. 297\u2013306 (2006)","DOI":"10.1007\/11944874_27"},{"key":"6_CR6","volume-title":"ACM Conference on Electronic Commerce","author":"C. Daskalakis","year":"2007","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress on approximate Nash equilibria. In: ACM Conference on Electronic Commerce, ACM Press, New York (2007)"},{"key":"6_CR7","volume-title":"ACM Conference on Electronic Commerce","author":"T. Feder","year":"2007","unstructured":"Feder, T., Nazerzadeh, H., Saberi, A.: Approximating Nash equilibria with small-support strategies. In: ACM Conference on Electronic Commerce, ACM Press, New York (2007)"},{"key":"6_CR8","first-page":"61","volume-title":"Annual ACM Symposium on Theory of Computing","author":"P. Goldberg","year":"2006","unstructured":"Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: Annual ACM Symposium on Theory of Computing, pp. 61\u201370. ACM Press, New York (2006)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S., Panagopoulou, P., Spirakis, P.: Polynomial algorithms for approximating Nash equilibria of bimatrix games. In: Workshop on Internet and Network Economics (2006)","DOI":"10.1007\/11944874_26"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S., Spirakis, P.: Efficient algorithms for constant well supported approximate equilibria in bimatrix games. In: 34th International Colloquium on Automata, Languages and Programming (2007)","DOI":"10.1007\/978-3-540-73420-8_52"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/779928.779933","volume-title":"4th ACM Conference on Electronic Commerce","author":"R. Lipton","year":"2003","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: 4th ACM Conference on Electronic Commerce, pp. 36\u201341. ACM Press, New York (2003)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Annals of Mathematics\u00a054, 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Spirakis, P., Tsaknakis, H.: An optimization approach for approximate Nash equilibria. In: Workshop on Internet and Network Economics (2007)","DOI":"10.1080\/15427951.2008.10129172"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:37Z","timestamp":1619506837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_6","relation":{},"subject":[]}}