{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:25:26Z","timestamp":1743099926980,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86593-1_18","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"259-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computational Complexity of Computing a Quasi-Proper Equilibrium"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1155-8072","authenticated-orcid":false,"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Troels Bjerre","family":"Lund","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01769861","volume":"13","author":"E van Damme","year":"1984","unstructured":"van Damme, E.: A relation between perfect equilibria in extensive form games and proper equilibria in normal form games. Int. J. Game Theory 13, 1\u201313 (1984). https:\/\/doi.org\/10.1007\/BF01769861","journal-title":"Int. J. Game Theory"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.geb.2019.03.006","volume":"125","author":"K Etessami","year":"2021","unstructured":"Etessami, K.: The complexity of computing a (quasi-)perfect equilibrium for an $$n$$-player extensive form game. Games Econ. Behav. 125, 107\u2013140 (2021). https:\/\/doi.org\/10.1016\/j.geb.2019.03.006","journal-title":"Games Econ. Behav."},{"key":"18_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-44803-8_20","volume-title":"SAGT 2014","author":"K Etessami","year":"2014","unstructured":"Etessami, K., Hansen, K.A., Miltersen, P.B., S\u00f8rensen, T.B.: The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 231\u2013243. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_20"},{"issue":"6","key":"18_CR4","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."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Farina, G., Gatti, N.: Extensive-form perfect equilibrium computation in two-player games. In: AAAI, pp. 502\u2013508. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10571"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-014-0757-1","volume":"153","author":"MX Goemans","year":"2014","unstructured":"Goemans, M.X.: Smallest compact formulation for the permutahedron. Math. Program. 153(1), 5\u201311 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0757-1","journal-title":"Math. Program."},{"issue":"7","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1007\/s00224-018-9887-9","volume":"63","author":"KA Hansen","year":"2018","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 (2018). https:\/\/doi.org\/10.1007\/s00224-018-9887-9","journal-title":"Theory Comput. Syst."},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Hansen, K.A., Lund, T.B.: Computational complexity of proper equilibrium. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, pp. 113\u2013130. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3219166.3219199","DOI":"10.1145\/3219166.3219199"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Lund, T.B.: Computational complexity of computing a quasi-proper equilibrium. arXiv:2107.04300 [cs.GT] (2021)","DOI":"10.1007\/978-3-030-86593-1_18"},{"key":"18_CR10","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":"KA 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. 6386, pp. 198\u2013209. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16170-4_18"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hillas, J., Kohlberg, E.: Foundations of strategic equilibria. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory, vol. 3, chap. 42, pp. 1597\u20131663. Elsevier Science (2002)","DOI":"10.1016\/S1574-0005(02)03005-9"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/game.1996.0051","volume":"14","author":"D Koller","year":"1996","unstructured":"Koller, D., Megiddo, N., von Stengel, B.: Efficient computation of equilibria for extensive two-person games. Games Econom. Behav. 14, 247\u2013259 (1996). https:\/\/doi.org\/10.1006\/game.1996.0051","journal-title":"Games Econom. Behav."},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"DM Kreps","year":"1982","unstructured":"Kreps, D.M., Wilson, R.: Sequential equilibria. Econometrica 50(4), 863\u2013894 (1982). https:\/\/doi.org\/10.2307\/1912767","journal-title":"Econometrica"},{"key":"18_CR14","first-page":"193","volume-title":"Contributions to the Theory of Games II","author":"HW Kuhn","year":"1953","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games II, pp. 193\u2013216. Princeton University Press, Princeton (1953)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C Lemke","year":"1965","unstructured":"Lemke, C.: Bimatrix equilibrium points and mathematical programming. Manag. Sci. 11, 681\u2013689 (1965). https:\/\/doi.org\/10.1287\/mnsc.11.7.681","journal-title":"Manag. Sci."},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/S0899-8256(05)80007-7","volume":"8","author":"JF Mertens","year":"1995","unstructured":"Mertens, J.F.: Two examples of strategic equilibrium. Games Econ. Behav. 8(2), 378\u2013388 (1995). https:\/\/doi.org\/10.1016\/S0899-8256(05)80007-7","journal-title":"Games Econ. Behav."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00199-009-0440-6","volume":"42","author":"PB Miltersen","year":"2010","unstructured":"Miltersen, P.B., S\u00f8rensen, T.B.: Computing a quasi-perfect equilibrium of a two-player game. Econ. Theor. 42(1), 175\u2013192 (2010). https:\/\/doi.org\/10.1007\/s00199-009-0440-6","journal-title":"Econ. Theor."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01753236","volume":"15","author":"RB Myerson","year":"1978","unstructured":"Myerson, R.B.: Refinements of the Nash equilibrium concept. Int. J. Game Theory 15, 133\u2013154 (1978). https:\/\/doi.org\/10.1007\/BF01753236","journal-title":"Int. J. Game Theory"},{"issue":"54","key":"18_CR19","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)","journal-title":"Ann. Math."},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80063-7","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Rado, R.: An inequality. J. Lond. Math. Soc. s1\u201327(1), 1\u20136 (1952). https:\/\/doi.org\/10.1112\/jlms\/s1-27.1.1","DOI":"10.1112\/jlms\/s1-27.1.1"},{"key":"18_CR22","first-page":"301","volume":"12","author":"R Selten","year":"1965","unstructured":"Selten, R.: Spieltheoretische behandlung eines oligopolmodells mit nachfragetr\u00e4gheit. Zeitschrift f\u00fcr die gesamte Staatswissenshaft 12, 301\u2013324 (1965)","journal-title":"Zeitschrift f\u00fcr die gesamte Staatswissenshaft"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R Selten","year":"1975","unstructured":"Selten, R.: A reexamination of the perfectness concept for equilibrium points in extensive games. Int. J. Game Theory 4, 25\u201355 (1975). https:\/\/doi.org\/10.1007\/BF01766400","journal-title":"Int. J. Game Theory"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"S\u00f8rensen, T.B.: Computing a proper equilibrium of a bimatrix game. In: Faltings, B., Leyton-Brown, K., Ipeirotis, P. (eds.) ACM Conference on Electronic Commerce, EC \u201912, pp. 916\u2013928. ACM (2012). https:\/\/doi.org\/10.1145\/2229012.2229081","DOI":"10.1145\/2229012.2229081"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1111\/1468-0262.00300","volume":"70","author":"B von Stengel","year":"2002","unstructured":"von Stengel, B., van den Elzen, A., Talman, D.: Computing normal form perfect equilibria for extensive two-person games. Econometrica 70(2), 693\u2013715 (2002). https:\/\/doi.org\/10.1111\/1468-0262.00300","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:39:13Z","timestamp":1673224753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation 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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","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":"94","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":"30","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":"32% - 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":"8.54","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}