{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:45:47Z","timestamp":1742989547595,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239373"},{"type":"electronic","value":"9783642239380"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23938-0_49","type":"book-chapter","created":{"date-parts":[[2011,9,11]],"date-time":"2011-09-11T20:40:55Z","timestamp":1315773655000},"page":"485-494","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Nash Equilibria in Bimatrix Games"],"prefix":"10.1007","author":[{"given":"Urszula","family":"Boryczka","sequence":"first","affiliation":[]},{"given":"Przemyslaw","family":"Juszczuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612 (2006).","DOI":"10.1109\/FOCS.2006.20"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: 47th Symposium Foundations of Computer Science, pp. 261\u2013271 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2008.12.031","volume":"410","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. Journal Theoretical Computer Science\u00a0410, 1581\u20131588 (2009)","journal-title":"Journal Theoretical Computer Science"},{"key":"49_CR4","unstructured":"Dickhaut, J., Kaplan, T.: A program for finding Nash equilibria, Working papers, University of Minnesota, Department of Economics (1991)"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 113\u2013123 (2007)","DOI":"10.1109\/FOCS.2007.39"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I. Gilboa","year":"1989","unstructured":"Gilboa, I.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior\u00a01, 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Hammerstein, P., Selten, R.: Handbook of game theory - Chapter Game theory and evolutionary biology. University of Bonn (1994)","DOI":"10.1016\/S1574-0005(05)80060-8"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1016\/j.tcs.2008.12.033","volume":"410","author":"S.C. Kontogiannis","year":"2009","unstructured":"Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: Polynomial algorithms for approximating Nash equilibria of bimatrix games. Journal Theoretical Computer Science\u00a0410, 1599\u20131606 (2009)","journal-title":"Journal Theoretical Computer Science"},{"key":"49_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. Society for Industrial and Applied Mathematics\u00a012, 413\u2013423 (1964)","journal-title":"Society for Industrial and Applied Mathematics"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.asoc.2004.01.005","volume":"4","author":"G.D. Magoulas","year":"2004","unstructured":"Magoulas, G.D., Plagianakos, V.P., Vrahatis, M.N.: Neural Network-Based Colonoscopic Diagnosis using On-Line Learning and Differential Evolution. Applied Soft Computing\u00a04, 369\u2013379 (2004)","journal-title":"Applied Soft Computing"},{"key":"49_CR11","unstructured":"McKelvey, R.D., McLennan, A.M., Turocy, T.L.: Gambit: Software Tools for Game Theory, Version 0.2010.09.01 (2010), http:\/\/www.gambit-project.org"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1111\/j.1468-0262.2005.00567.x","volume":"73","author":"A. McLennan","year":"2005","unstructured":"McLennan, A.: The Expected Number of Nash Equilibria of a Normal Form Game. Econometrica\u00a073, 141\u2013174 (2005)","journal-title":"Econometrica"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Murugavel, A.K., Ranganathan, N.: A Game-Theoretic Approach for Binding in Behavioral Synthesis. In: 16th International Conference on VLSI Design, pp. 452\u2013458 (2003)","DOI":"10.1109\/ICVD.2003.1183176"},{"issue":"2","key":"49_CR14","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(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"issue":"4","key":"49_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/COMST.2005.1593279","volume":"7","author":"J. Neel","year":"2005","unstructured":"Neel, J., Mackenzie, A., Menon, R., Dasilva, L., Hicks, J., Reed, G.J.R.: Using game theory to analyze wireless ad hoc networks. IEEE Communications Surveys & Tutorials\u00a07(4), 46\u201356 (2005)","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"49_CR16","unstructured":"Nudelman, E., Wortman, J., Shoham, Y., Leyton-Brown, K.: Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 2 (2004)"},{"key":"49_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511666742","volume-title":"Game theory and political theory","author":"P. Ordeshook","year":"1986","unstructured":"Ordeshook, P.: Game theory and political theory. Cambridge University Press, Cambridge (1986)"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Pavlidis, N., Parsopoulos, K., Vrahatis, M.: Computing Nash Equilibria Through Computational Intelligence Methods. Journal of Computational and Applied Mathematics, 113\u2013136 (2005)","DOI":"10.1016\/j.cam.2004.06.005"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.geb.2006.03.015","volume":"63","author":"R. Porter","year":"2008","unstructured":"Porter, R., Nudelman, E., Shoham, Y.: Simple Search Methods for Finding a Nash Equilibrium. Games and Economic Behavior\u00a063, 642\u2013662 (2008)","journal-title":"Games and Economic Behavior"},{"key":"49_CR20","unstructured":"Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer programming methods for finding Nash equilibria. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol.\u00a02, pp. 495\u2013501 (2005)"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Savani, R., von Stengel, B.: Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 258\u2013267 (2004)","DOI":"10.1109\/FOCS.2004.28"},{"issue":"4","key":"49_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization\u00a011(4), 341\u2013359 (1997)","journal-title":"Journal of Global Optimization"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Storn, R.: Differential evolution design of an iir-Filter. In: IEEE International Conference on Evolutionary Computation ICEC 1996, pp. 268\u2013273 (1996)","DOI":"10.1109\/ICEC.1996.542373"},{"key":"49_CR24","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.G.: 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","Computational Collective Intelligence. Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23938-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T05:52:53Z","timestamp":1560577973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23938-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239373","9783642239380"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23938-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}