{"type":"ScholarlyArticle","title":"Imperfect-Recall Games: Equilibrium Concepts and Their Complexity","authors":[{"name":"Emanuel Tewolde","slug":"emanuel-tewolde","given":"Emanuel","family":"Tewolde","affiliation":"Carnegie Mellon University; Foundations of Cooperative AI Lab (FOCAL)"},{"name":"Brian Hu Zhang","slug":"brian-hu-zhang","given":"Brian Hu","family":"Zhang","affiliation":"Carnegie Mellon University"},{"name":"Caspar Oesterheld","slug":"caspar-oesterheld","given":"Caspar","family":"Oesterheld","affiliation":"Carnegie Mellon University; Foundations of Cooperative AI Lab (FOCAL)"},{"name":"Manolis Zampetakis","slug":"manolis-zampetakis","given":"Manolis","family":"Zampetakis","affiliation":"Yale University"},{"name":"Tuomas Sandholm","slug":"tuomas-sandholm","given":"Tuomas","family":"Sandholm","affiliation":"Carnegie Mellon University; Strategic Machine, Inc. ,; Strategy Robot, Inc. ,; Optimized Markets, Inc."},{"name":"Paul Goldberg","slug":"paul-goldberg","given":"Paul","family":"Goldberg","affiliation":"University of Oxford"},{"name":"Vincent Conitzer","slug":"vincent-conitzer","given":"Vincent","family":"Conitzer","affiliation":"Carnegie Mellon University; University of Oxford; Foundations of Cooperative AI Lab (FOCAL)"}],"abstract":"We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. An example is the absentminded driver game, as well as team games in which the members have limited communication capabilities. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings across three different solution concepts: Nash, multiselves based on evidential decision theory (EDT), and multiselves based on causal decision theory (CDT). We are interested in both exact and approximate solution computation. As special cases, we consider (1) single-player games, (2) two-player zero-sum games and relationships to maximin values, and (3) games without exogenous stochasticity (chance nodes). We relate these problems to the complexity classes PPAD, PLS, Σ_2^P, ∃R, and ∃∀R.","doi":"10.24963/ijcai.2024/332","url":"https://ijcai.org/proceedings/2024/332","pdf":"https://ijcai.org/proceedings/2024/0332.pdf","markdown":"https://ijcai.org/proceedings/2024/332.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/332","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":332,"pages":{"first":2994,"last":3004},"keywords":["Game Theory and Economic Paradigms: GTEP: Noncooperative games"],"videos":[],"references":[{"position":1,"raw":"[Arora and Barak, 2009] Sanjeev Arora and Boaz Barak. Computational Complexity -A Modern Approach. Cam- bridge University Press, 2009.","title":"Computational Complexity -A Modern Approach","authors":"Sanjeev Arora, Boaz Barak","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Briggs, 2010] Rachael Briggs. Putting a value on Beauty. In Tamar Szabó Gendler and John Hawthorne, editor, Oxford Studies in Epistemology: Volume 3, pages 3-34. Oxford University Press, 2010.","title":"Putting a value on Beauty","authors":"Rachael Briggs","year":"2010","venue":"Oxford Studies in Epistemology","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brown and Sandholm, 2018] Noam Brown and Tuomas Sandholm. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals. Science, 359(6374):418- 424, 2018.","title":"Superhuman AI for heads-up no-limit poker: Libratus beats top professionals","authors":"Sandholm Brown, Noam Brown, Tuomas Sandholm","year":"2018","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brown and Sandholm, 2019] Noam Brown and Tuomas Sandholm. Superhuman AI for multiplayer poker. Sci- ence, 365(6456):885-890, 2019.","title":"Superhuman AI for multiplayer poker","authors":"Sandholm Brown, Noam Brown, Tuomas Sandholm","year":"2019","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brown et al., 2015] Noam Brown, Sam Ganzfried, and Tuo- mas Sandholm. Hierarchical abstraction, distributed equi- librium computation, and post-processing, with applica- tion to a champion no-limit Texas hold'em agent. In Ger- hard Weiss, Pinar Yolum, Rafael H. Bordini, and Edith Elkind, editors, Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Sys- tems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, pages 7-15. ACM, 2015.","title":"Hierarchical abstraction, distributed equilibrium computation, and post-processing, with application to a champion no-limit Texas hold'em agent","authors":"Brown","year":"2015","venue":"Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Buresh-Oppenheim and Morioka, 2004] Joshua Buresh- Oppenheim and Tsuyoshi Morioka. Relativized NP search problems and propositional proof systems. In Pro- ceedings of the 19th IEEE Conference on Computational Complexity (CCC), pages 54-67, 2004.","title":"Relativized NP search problems and propositional proof systems","authors":"Joshua Buresh, -Oppenheim, Tsuyoshi Morioka","year":"2004","venue":"Proceedings of the 19th IEEE Conference on Computational Complexity (CCC)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Buss and Johnson, 2012] Samuel R. Buss and Alan S. John- son. Propositional proofs and reductions between NP search problems. Annals of Pure and Applied Logic, 163(9):1163-1182, 2012.","title":"Propositional proofs and reductions between NP search problems","authors":"R Samuel, Alan S Buss, Johnson","year":"2012","venue":"Annals of Pure and Applied Logic","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Canny, 1988] John Canny. Some algebraic and geometric computations in PSPACE. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pages 460--467, New York, NY, USA, 1988. Asso- ciation for Computing Machinery.","title":"Some algebraic and geometric computations in PSPACE","authors":"John Canny","year":"1988","venue":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Celli and Gatti, 2018] Andrea Celli and Nicola Gatti. Com- putational results for extensive-form adversarial team games. In Sheila A. McIlraith and Kilian Q. Weinberger, editors, Proceedings of the Thirty-Second AAAI Confer- ence on Artificial Intelligence, (AAAI-18), the 30th innova- tive Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Ar- tificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pages 965-972. AAAI Press, 2018.","title":"Computational results for extensive-form adversarial team games","authors":"Andrea Celli, Nicola Gatti","year":"2018","venue":"AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chen et al., 2009] Xi Chen, Xiaotie Deng, and Shang-Hua Teng. Settling the complexity of computing two-player Nash equilibria. J. ACM, 56(3):14:1-14:57, 2009.","title":"Settling the complexity of computing two-player Nash equilibria","authors":"Xi Chen, Xiaotie Deng, Shang-Hua Teng","year":"2009","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Conitzer and Oesterheld, 2023] Vincent Conitzer and Cas- par Oesterheld. Foundations of cooperative AI. In Thirty- Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, February 7 -14, 2022. AAAI Press, 2023.","title":"Vincent Conitzer and Caspar Oesterheld. Foundations of cooperative AI","authors":"Oesterheld Conitzer","year":"2022","venue":"Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Conitzer, 2019] Vincent Conitzer. Designing preferences, beliefs, and identities for artificial intelligence. In Pro- ceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, pages 9755-9759, Honolulu, HI, USA, 2019.","title":"Designing preferences, beliefs, and identities for artificial intelligence","authors":"Vincent Conitzer","year":"2019","venue":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Daskalakis and Papadimitriou, 2011] Constantinos Daskalakis and Christos Papadimitriou. Continuous local search. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 790--804, USA, 2011. Society for Industrial and Applied Mathematics.","title":"Continuous local search","authors":"Constantinos Daskalakis, Christos Papadimitriou","year":"2011","venue":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Daskalakis et al., 2009] Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complex- ity of computing a Nash equilibrium. SIAM J. Comput., 39(1):195-259, 2009.","title":"The complexity of computing a Nash equilibrium","authors":"Constantinos Daskalakis, Paul W Goldberg, Christos H Papadimitriou","year":"2009","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Elga, 2000] Adam Elga. Self-locating belief and the Sleep- ing Beauty problem. Analysis, 60(2):143-147, 2000.","title":"Self-locating belief and the Sleeping Beauty problem","authors":"Elga ;, Adam Elga","year":"2000","venue":"Analysis","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Emmons et al., 2022] Scott Emmons, Caspar Oesterheld, Andrew Critch, Vincent Conitzer, and Stuart Russell. For learning in symmetric teams, local optima are global Nash equilibria. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, and Sivan Sabato, editors, International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, volume 162 of Proceedings of Machine Learning Re- search, pages 5924-5943. PMLR, 2022.","title":"For learning in symmetric teams, local optima are global Nash equilibria","authors":"Scott Emmons, Caspar Oesterheld, Andrew Critch, Vincent Conitzer, Stuart Russell","year":"2022","venue":"International Conference on Machine Learning, ICML 2022","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Etessami and Yannakakis, 2010] Kousha Etessami and Mi- halis Yannakakis. On the complexity of Nash equilibria and other fixed points. SIAM J. Comput., 39(6):2531- 2597, 2010.","title":"Kousha Etessami and Mihalis Yannakakis. On the complexity of Nash equilibria and other fixed points","authors":"Yannakakis Etessami","year":"2010","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fearnley et al., 2023] John Fearnley, Paul Goldberg, Alexandros Hollender, and Rahul Savani. The complexity of gradient descent: CLS = PPAD ∩ PLS. J. ACM, 70(1):7:1-7:74, 2023.","title":"The complexity of gradient descent: CLS = PPAD ∩ PLS","authors":"John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani","year":"2023","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Fudenberg and Tirole, 1991] Drew Fudenberg and Jean Ti- role. Game Theory. MIT Press, October 1991.","title":"Drew Fudenberg and Jean Tirole","authors":"Tirole Fudenberg","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Ganzfried and Sandholm, 2014] Sam Ganzfried and Tuo- mas Sandholm. Potential-aware imperfect-recall abstrac- tion with earth mover's distance in imperfect-information games. In Carla E. Brodley and Peter Stone, editors, Pro- ceedings of the Twenty-Eighth AAAI Conference on Artifi- cial Intelligence, July 27-31, 2014, Québec City, Québec, Canada, pages 682-690. AAAI Press, 2014.","title":"Potential-aware imperfect-recall abstraction with earth mover's distance in imperfect-information games","authors":"Sandholm Ganzfried, Sam Ganzfried, Tuomas Sandholm","year":"2014","venue":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gimbert et al., 2020] Hugo Gimbert, Soumyajit Paul, and B. Srivathsan. A bridge between polynomial optimization and games with imperfect recall. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '20, pages 456-464, Rich- land, SC, 2020. International Foundation for Autonomous Agents and Multiagent Systems. [Håstad, 2001]","title":"A bridge between polynomial optimization and games with imperfect recall","authors":"Hugo Gimbert, Soumyajit Paul, B Srivathsan","year":"2001","venue":"Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '20","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"Johan Håstad. Some optimal inapproxima- bility results. J. ACM, 48(4):798-859, 2001.","title":"Some optimal inapproximability results","authors":"Johan Håstad","year":"2001","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Johnson et al., 1988] David S. Johnson, Christos H. Pa- padimitriou, and Mihalis Yannakakis. How easy is lo- cal search? Journal of Computer and System Sciences, 37(1):79-100, 1988.","title":"How easy is local search","authors":"David S Johnson, Christos H Papadimitriou, Mihalis Yannakakis","year":"1988","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Kohli et al., 1994] Rajeev Kohli, Ramesh Krishnamurti, and Prakash Mirchandani. The minimum satisfiability problem. SIAM J. Discret. Math., 7(2):275-283, 1994.","title":"The minimum satisfiability problem","authors":"Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani","year":"1994","venue":"SIAM J. Discret. Math","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Koller and Megiddo, 1992] Daphne Koller and Nimrod Megiddo. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior, 4(4):528-552, 1992.","title":"Daphne Koller and Nimrod Megiddo. The complexity of two-person zero-sum games in extensive form","authors":"Megiddo Koller","year":"1992","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Kovarík et al., 2023] Vojtech Kovarík, Caspar Oesterheld, and Vincent Conitzer. Game theory with simulation of other players. In Proceedings of the Thirty-Second Inter- national Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 2800-2807. ijcai.org, 2023.","title":"Game theory with simulation of other players","authors":"Kovarík","year":"2023","venue":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023","doi":null,"url":null,"internal_url":"/proceedings/2023/312"},{"position":27,"raw":"[Kovarík et al., 2024] Vojtech Kovarík, Caspar Oesterheld, and Vincent Conitzer. Recursive joint simulation in games. CoRR, abs/2402.08128, 2024.","title":"Recursive joint simulation in games","authors":"Kovarík","year":"2024","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Kuhn, 1953] H. W. Kuhn. Extensive games and the prob- lem of information. In Harold William Kuhn and Al- bert William Tucker, editors, Contributions to the Theory of Games (AM-28), Volume II, chapter 11, pages 193-216.","title":"Extensive games and the problem of information","authors":"H W Kuhn","year":null,"venue":"Contributions to the Theory of Games (AM-28)","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Lambert et al., 2019] Nicolas S. Lambert, Adrian Marple, and Yoav Shoham. On equilibria in games with imperfect recall. Games Econ. Behav., 113:164-185, 2019.","title":"On equilibria in games with imperfect recall","authors":"Nicolas S Lambert, Adrian Marple, Yoav Shoham","year":"2019","venue":"Games Econ. Behav","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Lipton and Markakis, 2004] Richard J. Lipton and Evange- los Markakis. Nash equilibria via polynomial equations. In Martin Farach-Colton, editor, LATIN 2004: Theoreti- cal Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, volume 2976 of Lecture Notes in Computer Science, pages 413- 422. Springer, 2004.","title":"Nash equilibria via polynomial equations","authors":"Richard J Lipton, Evangelos Markakis","year":"2004","venue":"LATIN 2004: Theoretical Informatics, 6th Latin American Symposium","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Morioka, 2001] Tsuyoshi Morioka. Classification of search problems and their definability in bounded arithmetic. Master's thesis, University of Toronto, 2001.","title":"Classification of search problems and their definability in bounded arithmetic","authors":"Tsuyoshi Morioka","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Nash, 1950] John F. Nash. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36(1):48-49, 1950.","title":"Equilibrium points in n-person games","authors":"John F Nash","year":"1950","venue":"Proceedings of the National Academy of Sciences","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Nash, 1951] John Nash. Non-cooperative games. Annals of Mathematics, 54(2):286-295, 1951.","title":"John Nash. Non-cooperative games","authors":"Nash","year":"1951","venue":"Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Oesterheld and Conitzer, 2022] Caspar Oesterheld and Vin- cent Conitzer. Can de se choice be ex ante reasonable in games of imperfect recall? https://www.andrew.cmu.edu/ user/coesterh/DeSeVsExAnte.pdf, 2022. Working paper. Accessed: 2022-12-14.","title":"Can de se choice be ex ante reasonable in games of imperfect recall?","authors":"Conitzer Oesterheld","year":"2022","venue":null,"doi":null,"url":"https://www.andrew.cmu.edu/user/coesterh/DeSeVsExAnte.pdf","internal_url":null},{"position":35,"raw":"[Papadimitriou, 1994] Christos H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sci- ences, 48(3):498-532, 1994.","title":"On the complexity of the parity argument and other inefficient proofs of existence","authors":"Christos H Papadimitriou","year":"1994","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Piccione and Rubinstein, 1997] Michele Piccione and Ariel Rubinstein. On the interpretation of decision problems with imperfect recall. Games and Economic Behavior, 20(1):3-24, 1997.","title":"On the interpretation of decision problems with imperfect recall","authors":"Rubinstein Piccione, Michele Piccione, Ariel Rubinstein","year":"1997","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Renegar, 1992] James Renegar. On the computational com- plexity and geometry of the first-order theory of the re- als. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existen- tial theory of the reals. Journal of Symbolic Computation, 13(3):255-299, 1992.","title":"On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals","authors":"James Renegar","year":"1992","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Schaefer and Stefankovic, 2017] Marcus Schaefer and Daniel Stefankovic. Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst., 60(2):172-193, 2017.","title":"Marcus Schaefer and Daniel Stefankovic. Fixed points, Nash equilibria, and the existential theory of the reals","authors":"Stefankovic Schaefer","year":"2017","venue":"Theory Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Schäffer and Yannakakis, 1991] Alejandro A. Schäffer and Mihalis Yannakakis. Simple local search problems that are hard to solve. SIAM J. Comput., 20(1):56-87, 1991.","title":"Simple local search problems that are hard to solve","authors":"Alejandro A Schäffer, Mihalis Yannakakis","year":"1991","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Shor, 1990] Peter W. Shor. Stretchability of pseudolines is NP-hard. In Peter Gritzmann and Bernd Sturmfels, editors, Applied Geometry And Discrete Mathematics, Proceed- ings of a DIMACS Workshop, Providence, Rhode Island, USA, September 18, 1990, volume 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 531-554. DIMACS/AMS, 1990.","title":"Stretchability of pseudolines is NP-hard","authors":"Peter W Shor","year":"1990","venue":"Applied Geometry And Discrete Mathematics, Proceedings of a DIMACS Workshop","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Stockmeyer, 1976] Larry J. Stockmeyer. The polynomial- time hierarchy. Theor. Comput. Sci., 3(1):1-22, 1976.","title":"The polynomialtime hierarchy","authors":"Larry J Stockmeyer","year":"1976","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Strotz, 1955] R. H. Strotz. Myopia and inconsistency in dy- namic utility maximization. The Review of Economic Stud- ies, 23(3):165-180, 1955.","title":"Myopia and inconsistency in dynamic utility maximization","authors":"R H Strotz","year":"1955","venue":"The Review of Economic Studies","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Tewolde and Conitzer, 2024] Emanuel Tewolde and Vin- cent Conitzer. Game transformations that preserve nash equilibria or best-response sets. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, Jeju, South Korea, 3-9 August 2024. ijcai.org, 2024.","title":"Game transformations that preserve nash equilibria or best-response sets","authors":"Conitzer Tewolde","year":"2024","venue":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024","doi":null,"url":null,"internal_url":"/proceedings/2024/331"},{"position":44,"raw":"[Tewolde et al., 2023] Emanuel Tewolde, Caspar Oester- held, Vincent Conitzer, and Paul W. Goldberg. The com- putational complexity of single-player imperfect-recall games. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 2878- 2887. ijcai.org, 2023.","title":"The computational complexity of single-player imperfect-recall games","authors":"Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer, Paul W Goldberg","year":"2023","venue":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023","doi":null,"url":null,"internal_url":"/proceedings/2023/321"},{"position":45,"raw":"[von Stengel and Koller, 1997] Bernhard von Stengel and Daphne Koller. Team-maxmin equilibria. Games and Eco- nomic Behavior, 21(1-2):309-321, 1997.","title":"Bernhard von Stengel and Daphne Koller","authors":"Von Stengel, Koller","year":"1997","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Waugh et al., 2009] Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, and Michael H. Bowling. A practical use of imperfect recall. In Vadim Bulitko and J. Christopher Beck, editors, Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, Lake Arrowhead, California, USA, 8-10 August 2009. AAAI, 2009.","title":"A practical use of imperfect recall","authors":"Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, Michael H Bowling","year":"2009","venue":"Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Wichardt, 2008] Philipp C. Wichardt. Existence of Nash equilibria in finite extensive form games with imperfect re- call: A counterexample. Games Econ. Behav., 63(1):366- 369, 2008.","title":"Existence of Nash equilibria in finite extensive form games with imperfect recall: A counterexample","authors":"C Philipp, Wichardt","year":"2008","venue":"Games Econ. Behav","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Yannakakis, 2003] Mihalis Yannakakis. Computational complexity, pages 19-56. Princeton University Press, 2003.","title":"Computational complexity","authors":"Yannakakis","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Zhang and Sandholm, 2022] Brian Hu Zhang and Tuomas Sandholm. Polynomial-time optimal equilibria with a mediator in extensive-form games. In Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Process- ing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 -December 9, 2022, 2022.","title":"Polynomial-time optimal equilibria with a mediator in extensive-form games","authors":"Brian Hu, Zhang, Tuomas Sandholm","year":"2022","venue":"Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Zhang et al., 2023] Brian Hu Zhang, Gabriele Farina, and Tuomas Sandholm. Team belief DAG: generalizing the sequence form to team games for fast computation of cor- related team max-min equilibria via regret minimization. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA, volume 202 of Proceedings of Machine Learning Re- search, pages 40996-41018. PMLR, 2023.","title":"Team belief DAG: generalizing the sequence form to team games for fast computation of correlated team max-min equilibria via regret minimization","authors":"Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm","year":"2023","venue":"International Conference on Machine Learning, ICML 2023","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}