{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:51:27Z","timestamp":1765608687650,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_11","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"153-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria"],"prefix":"10.1007","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":[[2019,9,16]]},"reference":[{"issue":"2","key":"11_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. Pacific J. Math. 10(2), 381\u2013417 (1960). https:\/\/doi.org\/10.2140\/pjm.1960.10.381","journal-title":"Pacific J. Math."},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","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, Heidelberg (2008). https:\/\/doi.org\/10.1007\/3-540-33099-2","edition":"2"},{"issue":"3","key":"11_CR3","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."},{"key":"11_CR4","series-title":"LIPIcs","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.4230\/LIPIcs.STACS.2016.17","volume-title":"STACS 2016","author":"V Bil\u00f2","year":"2016","unstructured":"Bil\u00f2, V., Mavronicolas, M.: A catalog of $$\\exists \\mathbb{R}$$-complete decision problems about Nash equilibria in multi-player games. In: Ollinger, N., Vollmer, H. (eds.) STACS 2016. LIPIcs, vol. 47, pp. 17:1\u201317:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.17"},{"key":"11_CR5","series-title":"LIPIcs","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.4230\/LIPIcs.STACS.2017.13","volume-title":"STACS 2017","author":"V Bil\u00f3","year":"2017","unstructured":"Bil\u00f3, V., Mavronicolas, M.: $$\\exists \\mathbb{R}$$-complete decision problems about symmetric Nash equilibria in symmetric multi-player games. In: Vollmer, H., Vall\u00e9, B. (eds.) STACS 2017. LIPIcs, vol. 66, pp. 13:1\u201313:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Wadern (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.13"},{"issue":"1","key":"11_CR6","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. Amer. Math. Soc. 21(1), 1\u201346 (1989). https:\/\/doi.org\/10.1090\/S0273-0979-1989-15750-9","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"11_CR7","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":"11_CR8","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":"11_CR9","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":"11_CR10","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. IEEE Computer Society Press (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.69","DOI":"10.1109\/FOCS.2006.69"},{"issue":"2","key":"11_CR11","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":"11_CR12","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":"11_CR13","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":"11_CR14","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":"11_CR15","first-page":"723","volume-title":"AAMAS 2013","author":"N Gatti","year":"2013","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, Richland (2013)"},{"issue":"1","key":"11_CR16","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."},{"issue":"7","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1007\/s00224-018-9887-9","volume":"63","author":"Kristoffer Arnsfelt Hansen","year":"2018","unstructured":"Hansen, K.A.: The real computational complexity of minmax value and equilibrium refinements in multi-player games. Theory Comput. Syst. (2018). https:\/\/doi.org\/10.1007\/s00224-018-9887-9","journal-title":"Theory of Computing Systems"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-540-92185-1_74","volume-title":"Internet and Network Economics","author":"KA Hansen","year":"2008","unstructured":"Hansen, K.A., Hansen, T.D., Miltersen, P.B., S\u00f8rensen, T.B.: Approximability and parameterized complexity of minmax values. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 684\u2013695. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_74"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-662-48433-3_21","volume-title":"Algorithmic Game Theory","author":"R Mehta","year":"2015","unstructured":"Mehta, R., Vazirani, V.V., Yazdanbod, S.: Settling some open problems on 2-player symmetric Nash equilibria. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 272\u2013284. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48433-3_21"},{"issue":"54","key":"11_CR20","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."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"key":"11_CR22","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":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:33:45Z","timestamp":1709811225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}