{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:20:22Z","timestamp":1770063622841,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031432538","type":"print"},{"value":"9783031432545","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_3","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"40-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational Complexity of\u00a0Decision Problems About Nash Equilibria in\u00a0Win-Lose Multi-player Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7848-4904","authenticated-orcid":false,"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1155-8072","authenticated-orcid":false,"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0115-3045","authenticated-orcid":false,"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Abbott, T.G., Kane, D.M., Valiant, P.: On the complexity of two-player win-lose games. In: FOCS, pp. 113\u2013122 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.59","DOI":"10.1109\/SFCS.2005.59"},{"issue":"2","key":"3_CR2","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":"3_CR3","doi-asserted-by":"publisher","unstructured":"Austrin, P., Braverman, M., Chlamtac, E.: Inapproximability of NP-complete variants of Nash equilibrium. Theory Comput. 9, 117\u2013142 (2013). https:\/\/doi.org\/10.4086\/toc.2013.v009a003","DOI":"10.4086\/toc.2013.v009a003"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00224-022-10080-1","volume":"66","author":"MLT Berthelsen","year":"2022","unstructured":"Berthelsen, M.L.T., Hansen, K.A.: On the computational complexity of decision problems about multi-player Nash equilibria. Theory Comput. Syst. 66(3), 519\u2013545 (2022). https:\/\/doi.org\/10.1007\/s00224-022-10080-1","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"3_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)","journal-title":"Algorithmica"},{"issue":"3","key":"3_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-14:25 (2021). https:\/\/doi.org\/10.1145\/3456758","journal-title":"ACM Trans. Econ. Comput."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-79416-3_1","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Blanc","year":"2021","unstructured":"Blanc, M., Hansen, K.A.: Computational complexity of multi-player evolutionarily stable strategies. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 1\u201317. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_1"},{"issue":"1","key":"3_CR8","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)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"3_CR9","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)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"3_CR10","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":"3_CR11","doi-asserted-by":"publisher","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: STOC, pp. 460\u2013467. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62257","DOI":"10.1145\/62212.62257"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"14:","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of two-player Nash equilibrium. J. ACM 56(3), 14:-14:57 (2009)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR13","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 Econom. Behav. 63(2), 621\u2013641 (2008). https:\/\/doi.org\/10.1016\/j.geb.2008.02.015","journal-title":"Games Econom. Behav."},{"issue":"1","key":"3_CR14","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."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.10616\/j.jcss.2021.11002","volume":"125","author":"A Deligkas","year":"2022","unstructured":"Deligkas, A., Fearnley, J., Melissourgos, T., Spirakis, P.: Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125, 106\u2013128 (2022). https:\/\/doi.org\/10.10616\/j.jcss.2021.11002","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ic2018.06.001","volume":"262","author":"A Deligkas","year":"2018","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262, 40\u201356 (2018). https:\/\/doi.org\/10.1016\/j.ic2018.06.001","journal-title":"Inf. Comput."},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Erickson, J., van der Hoog, I., Miltzow, T.: Smoothing the gap between NP and $$\\exists \\mathbb{R} $$. In: FOCS, pp. 1022\u20131033 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00099","DOI":"10.1109\/FOCS46700.2020.00099"},{"issue":"6","key":"3_CR18","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)","journal-title":"SIAM J. Comput."},{"key":"3_CR19","doi-asserted-by":"publisher","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","DOI":"10.1145\/3175494"},{"issue":"1","key":"3_CR20","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 Econom. Behav. 1(1), 80\u201393 (1989). https:\/\/doi.org\/10.1016\/0899-8256(89)90006-7","journal-title":"Games Econom. Behav."},{"issue":"7","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1007\/s00224-018-9887-9","volume":"63","author":"KA Hansen","year":"2019","unstructured":"Hansen, K.A.: The real computational complexity of minmax value and equilibrium refinements in multi-player games. Theory Comput. Syst. 63(7), 1554\u20131571 (2019). https:\/\/doi.org\/10.1007\/s00224-018-9887-9","journal-title":"Theory Comput. Syst."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Maschler, M., Solan, E., Zamir, S.: Game Theory. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9780511794216"},{"issue":"54","key":"3_CR23","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":"3_CR24","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)","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-031-43254-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:15:09Z","timestamp":1693782909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","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":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2023","order":10,"name":"conference_id","label":"Conference ID","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"44% - 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":"5","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)"}}]}}