{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T10:06:42Z","timestamp":1791972402061,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450457","type":"print"},{"value":"9783642450464","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_9","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"96-108","source":"Crossref","is-referenced-by-count":6,"title":["The Exact Computational Complexity of Evolutionarily Stable Strategies"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Conitzer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, G., Conitzer, V.: Fast equilibrium computation for infinitely repeated games. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, Bellevue, WA, USA, pp. 53\u201359 (2013)","DOI":"10.1609\/aaai.v27i1.8573"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2009.04.016","volume":"70","author":"C. Borgs","year":"2010","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the Folk Theorem. Games and Economic Behavior\u00a070(1), 34\u201343 (2010)","journal-title":"Games and Economic Behavior"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Korzhyk, D.: Commitment to correlated strategies. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), San Francisco, CA, USA, pp. 632\u2013637 (2011)","DOI":"10.1609\/aaai.v25i1.7875"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Computing the optimal strategy to commit to. In: Proceedings of the ACM Conference on Electronic Commerce (EC), Ann Arbor, MI, USA, pp. 82\u201390 (2006)","DOI":"10.1145\/1134707.1134717"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V. Conitzer","year":"2008","unstructured":"Conitzer, V., Sandholm, T.: New complexity results about Nash equilibria. Games and Economic Behavior\u00a063(2), 621\u2013641 (2008)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM Journal on Computing\u00a039(1), 195\u2013259 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"9_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00182-007-0095-0","volume":"37","author":"K. Etessami","year":"2004","unstructured":"Etessami, K., Lochbihler, A.: The computational complexity of evolutionarily stable strategies. International Journal of Game Theory\u00a037(1), 93\u2013113 (2004); an earlier version was made available as ECCC tech report TR04-055 (2004)","journal-title":"International Journal of Game Theory"},{"issue":"6","key":"9_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 Journal on Computing\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR10","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., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior\u00a01, 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-16170-4_18","volume-title":"Algorithmic Game Theory","author":"K.A. Hansen","year":"2010","unstructured":"Hansen, K.A., Miltersen, P.B., S\u00f8rensen, T.B.: The computational complexity of trembling hand perfection and other equilibrium refinements. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 198\u2013209. Springer, Heidelberg (2010)"},{"key":"9_CR12","unstructured":"Jiang, A.X., Leyton-Brown, K.: Polynomial-time computation of exact correlated equilibrium in compact games. Games and Economic Behavior (2013)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-1-4613-3557-3_15","volume-title":"Minimax and Applications","author":"K.-I. Ko","year":"1995","unstructured":"Ko, K.-I., Lin, C.-L.: On the complexity of min-max optimization problems and their approximation. In: Du, D.-Z., Pardalos, P.M. (eds.) Minimax and Applications, pp. 219\u2013239. Kluwer Academic Publishers, Boston (1995)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-92185-1_28","volume-title":"Internet and Network Economics","author":"S.C. Kontogiannis","year":"2008","unstructured":"Kontogiannis, S.C., Spirakis, P.G.: Equilibrium points in fear of correlated threats. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C. Lemke","year":"1964","unstructured":"Lemke, C., Howson, J.: Equilibrium points of bimatrix games. Journal of the Society of Industrial and Applied Mathematics\u00a012, 413\u2013423 (1964)","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.dss.2004.08.007","volume":"39","author":"M.L. Littman","year":"2005","unstructured":"Littman, M.L., Stone, P.: A polynomial-time Nash equilibrium algorithm for repeated games. Decision Support Systems\u00a039, 55\u201366 (2005)","journal-title":"Decision Support Systems"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9_CR18","unstructured":"Nisan, N.: A note on the computational hardness of evolutionary stable strategies. Electronic Colloquium on Computational Complexity (ECCC)\u00a013(076) (2006)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing correlated equilibria in multi-player games. Journal of the ACM\u00a055(3) (2008)","DOI":"10.1145\/1379759.1379762"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games and the Internet. In: Proceedings of the Annual Symposium on Theory of Computing (STOC), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/246015a0","volume":"246","author":"G. Price","year":"1973","unstructured":"Price, G., Smith, J.M.: The logic of animal conflict. Nature\u00a0246, 15\u201318 (1973)","journal-title":"Nature"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1468-0262.2006.00667.x","volume":"74","author":"R. Savani","year":"2006","unstructured":"Savani, R., von Stengel, B.: Hard-to-solve bimatrix games. Econometrica\u00a074, 397\u2013429 (2006)","journal-title":"Econometrica"},{"key":"9_CR23","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: A compendium (2008)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"S\u00f8rensen, T.B.: Computing a proper equilibrium of a bimatrix game. In: Proceedings of the ACM Conference on Electronic Commerce (EC), Valencia, Spain, pp. 916\u2013928 (2012)","DOI":"10.1145\/2229012.2229081"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Suri, S.: Computational evolutionary game theory. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, vol.\u00a029. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.031"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.geb.2009.11.008","volume":"69","author":"B. von Stengel","year":"2010","unstructured":"von Stengel, B., Zamir, S.: Leadership games with convex strategy sets. Games and Economic Behavior\u00a069, 446\u2013457 (2010)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:52:35Z","timestamp":1676843555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}