{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:13:23Z","timestamp":1778498003502,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["9040-00433B"],"award-info":[{"award-number":["9040-00433B"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00224-022-10080-1","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T06:03:01Z","timestamp":1652248981000},"page":"519-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria"],"prefix":"10.1007","volume":"66","author":[{"given":"Marie Louisa T\u00f8lb\u00f8ll","family":"Berthelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1155-8072","authenticated-orcid":false,"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"issue":"2","key":"10080_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"RJ Aumann","year":"1960","unstructured":"Aumann, R. J.: Acceptable points in games of perfect information. Pac. J. Math. 10(2), 381\u2013417 (1960). https:\/\/doi.org\/10.2140\/pjm.1960.10.381","journal-title":"Pac. J. Math."},{"key":"10080_CR2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2008","unstructured":"Basu, S., Pollack, R., Roy, M. F.: Algorithms in Real Algebraic Geometry, 2nd edn. Springer, Berlin (2008)","edition":"2nd edn"},{"key":"10080_CR3","doi-asserted-by":"publisher","unstructured":"Berthelsen, M.L.T., Hansen, K.A.: On the computational complexity of decision problems about multi-player Nash equilibria. In: SAGT 2019, Lecture Notes in Computer Science, vol. 11801, pp 153\u2013167. Springer (2019), https:\/\/doi.org\/10.1007\/978-3-030-30473-7_11","DOI":"10.1007\/978-3-030-30473-7_11"},{"issue":"3","key":"10080_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00224-013-9523-7","volume":"54","author":"V Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, V., Mavronicolas, M.: Complexity of rational and irrational Nash equilibria. Theory Comput. Syst. 54(3), 491\u2013527 (2014). https:\/\/doi.org\/10.1007\/s00224-013-9523-7","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"10080_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00453-020-00763-x","volume":"83","author":"V Bil\u00f2","year":"2021","unstructured":"Bil\u00f2, V., Mavronicolas, M.: The complexity of computational problems about nash equilibria in symmetric win-lose games. Algorithmica 83(2), 447\u2013530 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00763-x","journal-title":"Algorithmica"},{"issue":"3","key":"10080_CR6","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/3456758","volume":"9","author":"V Bil\u00f2","year":"2021","unstructured":"Bil\u00f2, V., Mavronicolas, M.: $\\exists \\mathbb {R},$-complete decision problems about (symmetric) nash equilibria in (symmetric) multi-player games. ACM Trans. Econ. Comput. 9 (3), 14:1\u201314:25 (2021). https:\/\/doi.org\/10.1145\/3456758","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"10080_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21(1), 1\u201346 (1989). https:\/\/doi.org\/10.1090\/S0273-0979-1989-15750-9","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"10080_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10208-007-9006-9","volume":"9","author":"P B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P., Cucker, F.: Exotic quantifiers, complexity classes, and complete problems. Found. Comput. Math. 9(2), 135\u2013170 (2009). https:\/\/doi.org\/10.1007\/s10208-007-9006-9","journal-title":"Found. Comput. Math."},{"issue":"3","key":"10080_CR9","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss, J. F., Frandsen, G. S., Shallit, J. O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999). https:\/\/doi.org\/10.1006\/jcss.1998.1608","journal-title":"J. Comput. Syst. Sci."},{"key":"10080_CR10","doi-asserted-by":"publisher","unstructured":"Canny, J. F.: Some algebraic and geometric computations in PSPACE. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp 460\u2013467. ACM (1988), https:\/\/doi.org\/10.1145\/62212.62257","DOI":"10.1145\/62212.62257"},{"key":"10080_CR11","doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp 261\u2013272. Computer Society Press (2006), https:\/\/doi.org\/10.1109\/FOCS.2006.69","DOI":"10.1109\/FOCS.2006.69"},{"issue":"2","key":"10080_CR12","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 Econ. Behav. 63(2), 621\u2013641 (2008). https:\/\/doi.org\/10.1016\/j.geb.2008.02.015","journal-title":"Games Econ. Behav."},{"issue":"1","key":"10080_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P. W., Papadimitriou, C. H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009). https:\/\/doi.org\/10.1137\/070699652","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10080_CR14","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 J. Comput. 39(6), 2531\u20132597 (2010). https:\/\/doi.org\/10.1137\/080720826","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10080_CR15","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/3175494","volume":"6","author":"J Garg","year":"2018","unstructured":"Garg, J., Mehta, R., Vazirani, V. V., Yazdanbod, S.: $\\exists \\mathbb {R},$-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Trans. Econ. Comput. 6(1), 1:1\u20131:23 (2018). https:\/\/doi.org\/10.1145\/3175494","journal-title":"ACM Trans. Econ. Comput."},{"key":"10080_CR16","unstructured":"Gatti, N., Rocco, M., Sandholm, T.: On the Verification and Computation of Strong Nash Equilibrium. In: Gini, M.L., Shehory, O., Ito, T., Jonker, C.M. (eds.) AAMAS 2013, pp 723\u2013730. IFAAMAS (2013)"},{"issue":"1","key":"10080_CR17","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 Econ. Behav. 1(1), 80\u201393 (1989). https:\/\/doi.org\/10.1016\/0899-8256(89)90006-7","journal-title":"Games Econ. Behav."},{"key":"10080_CR18","doi-asserted-by":"publisher","unstructured":"Hansen, K. A.: The real computational complexity of minmax value and equilibrium refinements in multi-player games. Theory Comput. Syst. 63(7). https:\/\/doi.org\/10.1007\/s00224-018-9887-9 (2019)","DOI":"10.1007\/s00224-018-9887-9"},{"key":"10080_CR19","doi-asserted-by":"publisher","unstructured":"Hansen, K.A., Hansen, T.D., Miltersen, P.B., S\u00f8rensen, T.B.: Approximability and parameterized complexity of minmax values. In: Papadimitriou, C.H., Zhang, S. (eds.) WINE 2008, Lecture Notes in Computer Science, vol. 5385, pp 684\u2013695. Springer (2008), https:\/\/doi.org\/10.1007\/978-3-540-92185-1_74","DOI":"10.1007\/978-3-540-92185-1_74"},{"issue":"1","key":"10080_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4007\/annals.2016.183.1.2","volume":"183","author":"J Koenigsmann","year":"2016","unstructured":"Koenigsmann, J.: Defining $\\mathbb {Z}$ in $\\mathbb {Q}$. Ann. Math. 183 (1), 73\u201393 (2016). https:\/\/doi.org\/10.4007\/annals.2016.183.1.2","journal-title":"Ann. Math."},{"key":"10080_CR21","doi-asserted-by":"publisher","unstructured":"Mehta, R., Vazirani, V.V., Yazdanbod, S.: Settling some open problems on 2-player symmetric Nash equilibria. In: Hoefer, M. (ed.) SAGT 2015, Lecture Notes in Computer Science, vol. 9347, pp 272\u2013284. Springer (2015), https:\/\/doi.org\/10.1007\/978-3-662-48433-3_21","DOI":"10.1007\/978-3-662-48433-3_21"},{"issue":"54","key":"10080_CR22","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"2","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 2(54), 286\u2013295 (1951). https:\/\/doi.org\/10.2307\/1969529","journal-title":"Ann. Math."},{"issue":"3","key":"10080_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part i-III. J. Symb. Comput 13(3), 255\u2013352 (1992). https:\/\/doi.org\/10.1016\/S0747-7171(10)80003-3","journal-title":"J. Symb. Comput"},{"key":"10080_CR24","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Realizability of Graphs and Linkages. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp 461\u2013482. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-0110-0_24"},{"key":"10080_CR25","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60, 172\u2013193 (2017). https:\/\/doi.org\/10.1007\/s00224-015-9662-0","journal-title":"Theory Comput. Syst."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10080-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10080-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10080-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T06:07:18Z","timestamp":1655446038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10080-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10080"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10080-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,11]]},"assertion":[{"value":"6 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}