Superhuman AI for multiplayer poker
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
AI now masters six-player poker: Computer programs have shown superiority over humans in two-player games such as chess, Go, and heads-up, no-limit Texas hold'em poker. However, poker games usually include six players—a much trickier challenge for artificial intelligence than the two-player variant. Brown and Sandholm developed a program, dubbed Pluribus, that learned how to play six-player no-limit Texas hold'em by playing against five copies of itself (see the Perspective by Blair and Saffidine). When pitted against five elite professional poker players, or with five copies of Pluribus playing against one professional, the computer performed significantly better than humans over the course of 10,000 hands of poker. Science , this issue p. 885 ; see also p. 864
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Yet, although AI outperforms humans in an ever-broadening range of tasks, from playing poker (20) and Go (21) to translating languages (22) and diagnosing skin cancer (23), it trails far behind when it comes to ToM.”
From Evaluating large language models in theory of mind tasks (2024) · cites this paper as [20]
In the citing paper
“This ability to strategically misrepresent information helped Pluribus become the first AI system to achieve superhuman performance in heads-up, no-limit Texas hold ’em poker.”
From AI deception: A survey of examples, risks, and potential solutions (2024) · cites this paper as [7]
In the citing paper
“Pluribus demonstrated a clear ability to bluff in a video of its game against five professional human poker players.”
From AI deception: A survey of examples, risks, and potential solutions (2024) · cites this paper as [7]
Citations
Cites
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084 · cited 2×
“Real-time search has been necessary for achieving super-human performance in many perfect-information games, including backgammon ( 18 ), chess ( 8 ), and Go ( 9 , 19 ).”
BackgroundMethodNash, J. (1951) · The Annals of Mathematics · doi:10.2307/1969529 · Cited by 7,002
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Zur Theorie der Gesellschaftsspiele
v. Neumann, J. (1928) · Mathematische Annalen · doi:10.1007/bf01448847 · Cited by 2,572
Temporal difference learning and TD-Gammon
Tesauro, G. (1995) · Communications of the ACM · doi:10.1145/203330.203343 · Cited by 1,618 · cited 2×
“Real-time search has been necessary for achieving super-human performance in many perfect-information games, including backgammon ( 18 ), chess ( 8 ), and Go ( 9 , 19 ).”
BackgroundMethodCampbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
The Complexity of Computing a Nash Equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · SIAM Journal on Computing · doi:10.1137/070699652 · Cited by 921
DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
Moravčík, M., Schmid, M., Burch, N., Lisý, V., Morrill, D., Bard, N., Davis, T., Waugh, K., Johanson, M., & Bowling, M. (2017) · Science · doi:10.1126/science.aam6960 · Cited by 786
Temporal Difference Learning and TD-Gammon
Tesauro, G. (1995) · ICGA Journal · doi:10.3233/icg-1995-18207 · Cited by 764
Research works printed but not linked: 26
- S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2011) pp. 533–540.
- K. Berg T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2017).
- L. S. Shapley Advances in Game Theory M. Drescher L. S. Shapley A. W. Tucker Eds. (Princeton Univ. Press 1964).
- T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2015) pp. 4127–4131. Senior Member Track.
- M. Johanson N. Burch R. Valenzano M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2013) pp. 271–278.
- S. Ganzfried T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 682–690.
- N. Brown S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2015) pp. 7–15.
- M. Zinkevich M. Johanson M. H. Bowling C. Piccione in Neural Information Processing Systems (NeurIPS) (2007) pp. 1729–1736.
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2013).
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2016).
- N. Brown T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2016) pp. 4238–4239.
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information Games (2017).
- M. Lanctot K. Waugh M. Zinkevich in M. Bowling Neural Information Processing Systems (NeurIPS) (2009) pp. 1078–1086.
- M. Johanson N. Bard M. Lanctot R. Gibson M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2012) pp. 837–846.
- R. Gibson M. Lanctot N. Burch D. Szafron M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2012) pp. 1355–1361.
- N. Brown T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2019).
- S. Ganzfried T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2013) pp. 120–128.
- N. Brown T. Sandholm B. Amos in Neural Information Processing Systems (NeurIPS) (2018) pp. 7663–7674.
- M. Johanson K. Waugh M. Bowling M. Zinkevich in International Joint Conference on Artificial Intelligence (IJCAI) (2011) pp. 258–265.
- N. Burch M. Schmid M. Moravcik D. Morill M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2018) pp. 949–956.
- K. Waugh AAAI Workshop on Computer Poker and Imperfect Information (2013).
- A. Gilpin T. Sandholm T. B. Sørensen in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2007) pp. 50–57.
- S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2015) pp. 37–45.
- N. Burch M. Johanson M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 602–608.
- M. Moravcik M. Schmid K. Ha M. Hladik S. Gaukrodger in AAAI Conference on Artificial Intelligence (AAAI) (2016) pp. 572–578.
- N. Brown T. Sandholm in Neural Information Processing Systems (NeurIPS) (2017) pp. 689-699.
Cited by
Items 401–500 of 679
DouRN: Improving DouZero by Residual Neural Networks
Chen, Y., Lyu, Y., & Zhang, D. (2023) · International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) · doi:10.1109/cyberc58899.2023.00026 · Cited by 4
“Consequently, the widely used counterfactual regret minimization algorithm employed in poker [1] cannot be directly applied to this complex three-player games.”
MethodResultJi, H., & Jin, Y. (2024) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4065343 · Cited by 2
Selective policy transfer in multi-agent systems with sparse interactions
Zhuang, Y., Liu, Y., Yang, S., & Gao, Y. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.112031 · Cited by 3
Neural Network-Based Information Set Weighting for Playing Reconnaissance Blind Chess
Bertram, T., Fürnkranz, J., & Müller, M. (2024) · IEEE Transactions on Games · doi:10.1109/tg.2024.3425803 · Cited by 3
“In poker, various forms of counterfactual regret minimization [41], such as CFR + [6], Monte Carlo counterfactual regret minimization [9], [10], [20], or DeepStack [26] reign superior.”
GameTable Working Group 1 meeting report on search, planning, learning, and explainability
Soemers, D. J. N. J., Kowalski, J., Piette, É., Morenville, A., & Crist, W. (2024) · ICGA Journal · doi:10.3233/icg-240251 · Cited by 4
A Simple, Solid, and Reproducible Baseline for Bridge Bidding AI
Kita, H., Koyamada, S., Yamaguchi, Y., & Shin, I. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645547 · Cited by 2
Recording and Describing Poker Hands
Kim, J. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645611 · Cited by 2
Multi-DMC: Deep Monte-Carlo with Multi-Stage Learning in the Card Game UNO
Yang, X., Liu, X., & Lin, W. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645662 · Cited by 2
“…[1], AlphaGo Zero [2], Al-phaZero [3]) acquired famous achievements in 2016, various games have been developed, such as the board game Hex [4], the fighting game Blade & Soul [5], the stochastic puzzle game 2048 [6], and card games Mahjong [7], DouDizhu [8] [9], Texas Hold’em [10] [11] [12].”
BackgroundMethodJu, Q., Hei, F., Liu, Y., Fang, Z., & Luo, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0128-8_20 · Cited by 2
“Currently, it is more common to use an iterative approach to gradually approach an NE. Notably, the Regret Minimization algorithm (RM), its variants and Fictitious Play (FP) [9,10], have achieved significant success in games like poker [1,2] and Starcraft [3].”
MethodPurified Policy Space Response Oracles for Symmetric Zero-Sum Games
Shao, Z., Zhuang, L., Huang, Y., Li, H., & Wang, S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3457509 · Cited by 3
“…deep reinforcement learning (DRL) [31], [32], the NE solution of modern algorithms has changed a lot, such as AlphaGo mastering the game of Go [29], Suphx over the top of Mahjong [28], AlphaStar for StarCraft II [11], OpenAI Five for DOTA 2 [12], and Pluribus for no-limit Texas hold’em poker [33].”
Schwartz, J., Newbury, R., Kulić, D., & Kurniawati, H. (2025) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-025-09716-6 · Cited by 3
“Similar methods have been applied to zero-sum imperfect-information games [17, 18, 52, 88], as well as cooperative games where there is prior coordination for decentralized execution [19, 89].”
Robust Reinforcement Learning with Dynamic Distortion Risk Measures
Coache, A., & Sebastian Jaimungal, A. (2026) · SIAM Journal on Mathematics of Data Science · doi:10.1137/24m1699802 · Cited by 2
Ganzfried, S. (2019) · doi:10.1145/3356464.3357710 · Cited by 2
“n algorithm (CFR) [17] has been applied to approximate Nash equilibrium strategies in large imperfect-information games, and has led to computer agents that defeat some of the strongest human players [15, 4, 5]. Recently it has been shown that the speed of convergence can be significantly improved if actions that are p…”
MethodLazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information
Zhou, Y., Ren, T., Li, J., Yan, D., & Zhu, J. (2020) · International Conference on Learning Representations · Cited by 2
Imperfect and Cooperative Guandan Game System
Shen, H., Wu, L., Li, Y., & Li, X. (2020) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc49329.2020.9164725 · Cited by 2
“AI Pluribus based on self-play method successfully defeated multiple expert human players in six-player no-limit Texas Hold’em [4].”
MethodSpecial Topics in Information Technology
Geraci, A. (2021) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-030-62476-7 · Cited by 2
Newton Optimization on Helmholtz Decomposition for Continuous Games
Ramponi, G., & Restelli, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i13.17350 · Cited by 5
“…Yang, and Başar 2019) have made substantial progress in solving decisionmaking problems such as playing Go (Silver et al. 2016), robotic control problems (Lillicrap et al. 2015), playing card games (Brown and Sandholm 2019) and autonoumous driving (Shalev-Shwartz, Shammah, and Shashua 2016).”
BackgroundUsing human skills taxonomies and tests as measures of artificial intelligence
Davis, E. (2021) · Educational research and innovation · doi:10.1787/e182dd0d-en · Cited by 2
Odds Estimating with Opponent Hand Belief for Texas Hold’em Poker Agents
Hu, Z., Chen, J., Zhang, W., Chen, S., Yuan, W., Luo, J., Xu, J., & Ji, X. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-93046-2_5 · Cited by 2
Multi-agent Deception in Attack-Defense Stochastic Game
Li, X., Yi, S., & Sycara, K. P. (2022) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-92790-5_19 · Cited by 2
Opponent-Restricted Response Solving on Texas Hold’em Poker
Yuan, W., Hu, Z., Tingting, W., Luo, J., Zhang, W., & Chen, J. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9727647 · Cited by 2
“In this approach, a set of advanced poker AI (such as Libratus [1], Deepstack [2], and Pluribus [3]) achieves high performance by using CounterFactual Regret minimization(CFR) to search for approximate Nash Equilibrium (NE).”
MethodDCLN: Diverse Curriculum Learning with Neuroevolution in Six-Player Poker Tournament
Luo, J., Zhang, W., Yuan, W., & Chen, J. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9727883 · Cited by 2
Enlightened Management: Reflections on Spirituality and its Significance for the Future of Work
Cullen, A., & Singh, P. (2022) · Springer eBooks · doi:10.1007/978-981-19-1025-8_1 · Cited by 2
Improving the winning percentage of the Werewolf team through collusion strategies
Tanioka, H., & Kohri, R. (2021) · IIAI International Congress on Advanced Applied Informatics (IIAI-AAI) · doi:10.1109/iiai-aai53430.2021.00175 · Cited by 2
Mjx: A framework for Mahjong AI research
Koyamada, S., Habara, K., Goto, N., Okano, S., Nishimori, S., & Ishii, S. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893712 · Cited by 2
“Examples of reported AI progress through popular games include Backgammon [1], Chess [2], Go [3], [4], Shogi [5], Poker [6]– [8], and Atari 2600 [9].”
BackgroundExploring Deep Reinforcement Learning for Battling in Collectible Card Games
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2022) · Brazilian Symposium on Computer Games and Digital Entertainment (SBGames) · doi:10.1109/sbgames56371.2022.9961110 · Cited by 3
“These factors make them a more challenging domain than games like Go and Texas Hold’em Poker, the protagonists of recent breakthroughs in game-playing AI [1], [2].”
BackgroundTaking Myopic Best Response Against The Hedge Algorithm
Guo, X., & Mu, Y. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240896 · Cited by 2
“For six-player no-limit Texas hold ’em poker, Pluribus [4] is capable of defeating elite human professionals.”
BackgroundSurvey of Opponent Modeling: from Game AI to Combat Deduction
Liu, F., Wei, T., Zhang, Z., Chen, J., & Lu, L. (2024) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc62350.2024.10588019 · Cited by 2
“In 2019, Pluribus [3], developed by Carnegie Mellon University in the United States, reached another milestone in the field of artificial intelligence by defeating professional human players in multiplayer no-limit Texas Hold’ em.”
BackgroundXie, P., Wang, X., Yao, S., Liu, M., Zhao, X., & Zheng, R. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.128311 · Cited by 2
On High Grade Kidney Cancer and Machine Learning
Curci, N. E. (2019) · Academic Radiology · doi:10.1016/j.acra.2019.10.009 · Cited by 2
Bidding in SpadesPreprint
Cohensius, G., Meir, R., Oved, N., & Stern, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.11323 · Cited by 2
“Recently, AI agents have reached superhuman performance in the partial information game of no-limit poker [3, 4] and to a level of human experts in Bridge, which is considered to be one of the most appraised partial information problems for AI [1, 25, 16].”
BackgroundGidel, G., Balduzzi, D., Czarnecki, W. M., Garnelo, M., & Bachrach, Y. (2020) · arXiv (Cornell University) · Cited by 2
Efficient Competitive Self-Play Policy OptimizationPreprint
Zhong, Y., Zhou, Y., & Peng, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.06086 · Cited by 2
“Self-play is a training paradigm to generate data for learning in MARL and has led to great successes, achieving superhuman performance in many domains [25, 1, 9].”
BackgroundEvidence of Accelerating Mismeasurement of Growth and Inflation in the U.S. in the 21st Century
Nakamura, L. I. (2020) · Working paper · doi:10.21799/frbp.wp.2020.41 · Cited by 2
Haliem, M., Bonjour, T., Alsalem, A. O., Thomas, S., Li, H., Aggarwal, V., Bhargava, B., & Kejriwal, M. (2021) · arXiv (Cornell University) · Cited by 2
The AI Arena: A Framework for Distributed Multi-Agent Reinforcement LearningPreprint
Staley, E. W., Rivera, C. G., & Llorens, A. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.05737 · Cited by 2
Regret Minimization with Function Approximation in Extensive-Form Games
D'Orazio, R. (2020) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3-040j-9e84 · Cited by 2
“In particular, the dominant framework for approximating Nash equilibria in sequential games with imperfect information is Counterfactual Regret Minimization (CFR), which has successfully been used to solve and expertly play humanscale poker games [4, 7, 8, 41].”
MethodCarminati, L., Cacciamani, F., Ciccone, M., & Gatti, N. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.09161 · Cited by 2
“In this setting, superhuman performances have been achieved in real-world instances, such as Poker Hold’em (Brown & Sandholm, 2017b; 2019; Moravcı́k et al., 2017) and Starcraft II (Vinyals et al., 2019).”
BackgroundDeepMind AI topples experts at complex game Stratego
Ananthaswamy, A. (2022) · Nature · doi:10.1038/d41586-022-04246-7 · Cited by 2
Beikmohammadi, A. (2024) · Preprints.org · doi:10.20944/preprints202404.0813.v1 · Cited by 2
AI Behavioral SciencePreprint
Jackson, M. O., Mei, Q., Wang, S., Xie, Y., Yuan, W., Benzell, S. G., Brynjolfsson, E., Evans, J. A., Jabarian, B., Kleinberg, J. M., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5395006 · Cited by 12
NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash EquilibriaPreprint
Yu, E., Liu, T., Canonne, C. L., Wang, Y., Xu, C., Tran, N. H. K., & Albrecht, S. V. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.18183 · Cited by 2
“Empirically, benchmarking N ASH PG against domain-specific state-of-the-art methods, such as Pluribus [5], in large poker settings would further clarify its strengths.”
Discovering Multiagent Learning Algorithms with Large Language ModelsPreprint
Li, Z., Schultz, J., Hennes, D., & Lanctot, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.16928 · Cited by 4
“Because the discount multiplier is driven by a negative exponent, it rapidly decays toward zero, acting as an almost instantaneous “forget-gate” that prevents regret lock-in significantly faster than human-tuned DCFR baselines.”
InfluentialA logical modeling of the Yōkai board game
Davila, J. L. F., Longin, D., Lorini, E., & Maris, F. (2023) · AI Communications · doi:10.3233/aic-230050 · Cited by 1
“Well-known games such as chess [14], Go [40,41], poker [12,13], backgammon [15] and, more recently Diplomacy [34], have been considered.”
Human Strategic Decision Making in Parametrized Games
Ganzfried, S. (2022) · Mathematics · doi:10.3390/math10071147 · Cited by 1
Towards playing AIs for 7 Wonders: main patterns and strategies for 3-player games
Bettker, R. V., Minini, P. P., Pereira, G. K. R., & Assunção, J. (2021) · Brazilian Symposium on Computer Games and Digital Entertainment (SBGames) · doi:10.1109/sbgames54170.2021.00029 · Cited by 1
Extensive game decision based on the PPO-CFR algorithm under incomplete information
黄, 蕾., 朱, 进., & 段, 福. (2022) · Scientia Sinica Informationis · doi:10.1360/ssi-2022-0216 · Cited by 1
Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract)
Kovařík, V., Schmid, M. S., BURCH, N. R., Bowling, M., & Lisý, V. (2023) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/783 · Cited by 1
Investigating Cases and Clusters-Based Reuse Policies for Card-Playing Agents
Paulus, G. B., Vargas, D. P., Assunção, J., & Silva, L. A. L. (2023) · IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333218 · Cited by 1
“To approach the retention problem, outstanding game-playing agents’ performances have been achieved with the exploration of self-play learning [19].”
BackgroundOverview of Game Decision Intelligence
Wang, K., & Bai, D. (2023) · IEEE International Conference on Information, Communication and Networks (ICICN) · doi:10.1109/icicn59530.2023.10392489 · Cited by 1
“In 2019, the Carnegie Mellon University (CMU) research team developed Pluribus [11], a six-player no-limit Texas Ho ld’em poker AI, which defeated top human professional players for the first time in six-player no-limit poker.”
BackgroundMethodInfluentialMachine Learning Assisted Exploration for Affine Deligne–Lusztig Varieties
Dong, B., He, X., Jin, P., Schremmer, F., & Yu, Q. (2024) · Peking Mathematical Journal · doi:10.1007/s42543-024-00086-8 · Cited by 8
“…has become a leading force in different areas of artificial intelligence (AI), such as natural language processing (large language models such as ChatGPT [68]), computer vision (e.g., NeRF [44], diffusion models [32]) and games (e.g., mastering the game of Go [57], Poker [6], and StarCraft II [64]).”
Emergence of global receptive fields capturing multipartite quantum correlations
Sotnikov, O. M., Iakovlev, I. A., Kiktenko, E. O., Katsnelson, M. I., Fedorov, A. K., & Mazurenko, V. V. (2025) · Physical review. B./Physical review. B · doi:10.1103/t6sy-r7l5 · Cited by 3
Computational Lower Bounds for No-Regret Learning in Normal-Form Games
Anagnostides, I., Kalavasis, A., & Sandholm, T. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718250 · Cited by 1
Self-citationMitarai, S., Liu, C., Yamamoto, G., & Munekata, N. (2025) · Entertainment Computing · doi:10.1016/j.entcom.2025.100986 · Cited by 1
“While complete information games like chess and Go have been effectively conquered by AI through deep learning and search techniques [3], incomplete information games like poker have required additional innovations to handle hidden information and opponent modeling [4].”
When engineering meets economics: AI-powered safe and accountable autonomous driving
Di, X. S., Dawid, H., & Muehlheusser, G. (2025) · Artificial Intelligence for Transportation · doi:10.1016/j.ait.2025.100020 · Cited by 2
Empirical Validation of the Independent Chip Model
Kim, J.-H. (2025) · IEEE Conference on Games (CoG) · doi:10.1109/cog64752.2025.11114139 · Cited by 1
Mxplainer: Explain and Learn Insights by Imitating Mahjong Agents
Li, L., Lu, Y., Wang, Y., Zheng, Q., & Li, W. (2025) · Algorithms · doi:10.3390/a18120738 · Cited by 1
“Card games, like heads-up no-limit hold’em (HUNL) [3,4], Doudizhu [5,6], and Mahjong [7], present different dynamics with their imperfect-information nature, where agents must infer and cope with hidden information from states.”
Dynamic homophily with imperfect recall: modeling resilience in adversarial networks
Alqithami, S. (2025) · Social Network Analysis and Mining · doi:10.1007/s13278-025-01483-2 · Cited by 3
“Traditional homophily models, however, typically overlook imperfect recall —the phenomenon where agents gradually “forget” older interactions as time progresses [6].”
Visibility into Agentic AI for Required System Theory and Increasing Harms in Algorithmic System
Kunchakuri, N., Patchigolla, V. L., Kedlaya, A. S., & Upreti, T. (2025) · International Conference on Information Systems and Computer Networks (ISCON) · doi:10.1109/iscon65210.2025.11340987 · Cited by 1
“RL systems showed superhuman performance on a wider variety of specific activities, including video games [14] and increasingly complex board games [15], with little to no human supervision when deep learning was incorporated.”
Peng, W., Lim, J. Z., Liu, Q., & Wang, X. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-7072-0_22 · Cited by 3
DTCard: A Framework for Decision Transformers in Card Games
Demirdover, B. K., Alpaslan, F. N., & Tan, M. (2026) · Applied Sciences · doi:10.3390/app16073117 · Cited by 1
Overcoming Challenges of Realism in Competitive Space-Based Reinforcement Learning with AstroCraft
Anderson, L. J., Erwin, R. S., Hansen, M., Outkin, V., Qureshi, R. S., Aborizk, A., Kulkarni, R., Dennery, E., Senapathy, S., Makkapati, S., et al. (2026) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero66936.2026.11519822 · Cited by 1
A strategic approach to gambling regulation
Newall, P. W. S. (2026) · Addiction Research & Theory · doi:10.1080/16066359.2026.2677582 · Cited by 1
Leadership Games: Multiple Followers, Multiple Leaders, and Perfection
Marchesi, A. (2021) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-030-62476-7_10 · Cited by 1
Analysis of Strategic Evolution Structure of 5-player Werewolf Based on Simulation
Takeda, A., & Toriumi, F. (2021) · Transactions of the Japanese Society for Artificial Intelligence · doi:10.1527/tjsai.36-4_a-k64 · Cited by 1
Analyzing simplified Geister using DREAM
Troillet, L., & Matsuzaki, K. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9619080 · Cited by 1
“Research on IIGs so far has been focused on card and video games [2] [3] [4] [5] [6] [7] but not much on board games despite them presenting different challenges, specifically, they have bigger input and action spaces, they require spatial awareness and, in many cases, they contain possible…”
BackgroundGuerraoui, R., Gupta, N., & Pinot, R. (2024) · Machine learning · doi:10.1007/978-981-97-0688-4_1 · Cited by 1
Research Programs Based on Machine Intelligence Games
Tamburrini, G., & Altiero, F. (2020) · Philosophy of engineering and technology · doi:10.1007/978-3-030-54522-2_11 · Cited by 1
Collins, J. B., & Dasgupta, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-55692-1_1 · Cited by 1
Was kann Künstliche Intelligenz?
Paaß, G., & Hecker, D. (2020) · Künstliche Intelligenz · doi:10.1007/978-3-658-30211-5_2 · Cited by 1
The application of imperfect information game theory in social games
Guo, N., & Qu, Z. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1883/1/012068 · Cited by 1
“It has been used in every major AI milestone in poker [13,21,23,30].”
MethodTargeted Upskilling Framework based on Player Mistake Context in Online Skill Gaming Platforms
Agrawal, S., Sachdeva, M., & Mukherjee, T. (2021) · International Conference on AI-ML Systems (AIMLSystems) · doi:10.1145/3486001.3486234 · Cited by 1
“…play the game as skillfully as or better than a human, utilizing techniques such as Monte Carlo Tree Search and deep reinforcement learning for deterministic games such as, Backgammon, Checkers, Jeopardy!, Chess, Go, Atari, and recently in the stochastic space for Poker [5– 7, 15–19, 25].”
MethodNew approaches to understanding the impact of computers on work and education
Révai, N., Staneva, M., & Baret, A. (2021) · Educational research and innovation · doi:10.1787/65774a32-en · Cited by 1
Kiekintveld, C. D., Kamhoua, C., Fang, F., & Zhu, Q. (2021) · Wiley eBooks · doi:10.1002/9781119723950.ch1 · Cited by 1
Playing Geister by Estimating Hidden Information with Deep Reinforcement Learning
Tomoda, K., & Hasebe, K. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9618992 · Cited by 1
“These studies range from perfect information games, such as Go and chess, to imperfect information games, such as poker [8] [3].”
BackgroundResultLeveraging Game AI to Transform Integrated Brownfield Well Planning
Shuaibi, F., Harthi, M., Large, S., Obilaja, J.-F., Senani, M., Gomez, C. M., Mahrazy, K., Hussain, M., Busaidi, M. A., Savels, T., et al. (2021) · Abu Dhabi International Petroleum Exhibition & Conference (ADIPEC) · doi:10.2118/207947-ms · Cited by 1
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games
Farina, G., & Sandholm, T. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i5.20431 · Cited by 1
Self-citationFrost, J. J. (2022) · Emergence, complexity and computation · doi:10.1007/978-3-031-04379-6_1 · Cited by 1
Application of Deep Reinforcement Learning in Guandan Game
Pan, J. H., Zhang, Z., Shen, H., Zeng, Y., & Wu, L. (2022) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc55256.2022.10033565 · Cited by 1
EnsembleCard : A Strategy Ensemble Bot For Two-Player No-Limit Texas Hold’em Poker
Yuan, W., Wei, T., Luo, J., Lu, L., Zhang, W., & Chen, J. (2022) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc55256.2022.10033777 · Cited by 1
“In recent years, various game AIs have taken a great break-through for beating professional human players, such as AlphZero [2], AlphaStar[3], Commander[4], Suphx [5] and Pluribus[6, 7].”
BackgroundFrom StarCraft II to Military Combat
Sun, Y., Liu, J., & Sun, Q. (2022) · International Conference on Computing and Pattern Recognition (ICCPR) · doi:10.1145/3581807.3581895 · Cited by 1
“Finally, different structures of man-machine fusion combat are deployed and applied in complex combat scenarios[17][18][22].”
BackgroundFunction Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games
Ling, C. K., Kolter, J. Z., & Fang, F. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i5.25715 · Cited by 1
Don’t Predict Counterfactual Values, Predict Expected Values Instead
Wołosiuk, J., Świechowski, M., & Mańdziuk, J. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i4.25661 · Cited by 1
“• The efficacy of the proposed method is proven by its comparison with the DCVN approach, which is considered the state-of-the-art (SOTA) approach in the literature (Moravčı́k et al. 2017; Zarick et al. 2020; Brown and Sandholm 2019), in 7 experimental setups described in detail in section 6.”
MethodInfluentialRemembering ‘Texas Hold’em Heads Up Poker’, the first skill-based electronic gaming machine
Newall, P. W. S. (2023) · Journal of Gambling Issues · doi:10.4309/geol6662 · Cited by 1
“However, computers can now play no-limit hold ‘em better than top professionals can (Brown & Sandholm, 2017, 2019), and so if this was the reason for THHUP being discontinued, it would seem like a more popular version playing no-limit hold ‘em could be developed.”
Anticipatory thinking in design
Klenk, M., Hong, M., Hakimi, S., & Wu, C. C. (2023) · AI Magazine · doi:10.1002/aaai.12101 · Cited by 1
Parameter Identification for Fictitious Play Algorithm in Repeated Games
Dong, H., & Mu, Y. (2023) · Communications in computer and information science · doi:10.1007/978-981-99-7590-7_22 · Cited by 1
ε-Maximum Critic Deep Deterministic Policy Gradient for Multi-agent Reinforcement Learning
Jiang, Y., Di, K., Hu, Z., Chen, F., Li, P., & Jiang, Y. (2023) · Lecture notes in electrical engineering · doi:10.1007/978-981-99-8211-0_17 · Cited by 1
de Marchi, S. (2023) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780192868282.013.80 · Cited by 1
Yuan, M., & Freris, N. M. (2023) · International Conference on Big Data Computing and Communications (BigCom) · doi:10.1109/bigcom61073.2023.00042 · Cited by 4
“Notable achievements range from two-player games, such as simple Leduc Hold’em [8] and heads-up limit/no-limit Texas Hold’em [9] [10], to multi-player games, such as multi-player Texas Hold’em [11], StarCraft [12], Dota 2 [13], and Mahjong [14].”
BackgroundGame Interactive Learning: A New Paradigm towards Intelligent Decision-Making
Xing, J., Wu, Z., Yu, Z., Yan, R., Ji, Z., Tao, P., & Shi, Y. (2023) · CAAI Artificial Intelligence Research · doi:10.26599/air.2023.9150027 · Cited by 1
Multi-Agent Reinforcement Learning Method Based on Value Distribution
韩, 明. (2024) · Computer Science and Application · doi:10.12677/csa.2024.144090 · Cited by 1
Luo, J., Zhang, W., Gu, X., Wang, Z., & Chen, J. (2024) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc62350.2024.10587560 · Cited by 1
“Although the AI practice related to multi-player Texas Hold ’em (such as Pluribus [7] ) has made a breakthrough, the research on its related game theory is still being explored.”
BackgroundELO-Rated Sequence Rewards: Advancing Reinforcement Learning Models
Ju, Q., Hei, F., Fang, Z., & Luo, Y. (2024) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls61622.2024.10606606 · Cited by 2
“Deep Reinforcement Learning (RL) has achieved remarkable progress in various fields, including Atari games [7], Go [2, 5], poker [12], and video gaming [4, 6].”
Fuzzy Utility AI for Handling Uncertainty in Video Game Bots Implementation
Świechowski, M. (2024) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612092 · Cited by 1
“There are many imperfect information games used in research such as Poker [6] or Bridge [7], and most of the video games are formally imperfect information.”
BackgroundPerfect Information Monte Carlo with Postponing Reasoning
Arjonilla, J., Saffidine, A., & Cazenave, T. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645574 · Cited by 1
“Search algorithms in artificial intelligence have significantly evolved, demonstrating superhuman performance in games such as Chess, Go [1], Poker [2], Skat [3], and Contract Bridge [4].”
BackgroundA Taxonomy of Collectible Card Games from a Game-Playing AI Perspective
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-74353-5_12 · Cited by 1
“…last decade has seen a rise in the popularity of AI for CCGs. Building on the success in less complex games such as Go [43] and Texas Hold’em Poker [6], in recent years, a deep reinforcement learning AI agent beat a top-level human player three wins to none in a best-of-five match of Hearthstone…”
BackgroundIsmail, M. S. (2025) · International Economic Review · doi:10.1111/iere.12764 · Cited by 5
The Cost of Uncertainty in Self-Play Reinforcement Learning and Search
Oscarsson, M., Brynielsson, J., Cohen, M., Kamrani, F., & Limér, C. (2025) · IEEE International Conference on Intelligence and Security Informatics (ISI) · doi:10.1109/isi65680.2025.11201174 · Cited by 1
“In 2018, the team behind Libratus released Pluribus, extending their techniques from heads-up poker to six-player variants of the game [10].”
ColosseumRL: A Framework for Multiagent Reinforcement Learning in $N$-Player GamesPreprint
Shmakov, A., Lanier, J. B., McAleer, S., Achar, R., Lopes, C. V., & Baldi, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.04451 · Cited by 1
“that nd success in two-player zero-sum games such as CFR, tree search and self-play can nd very good strategies in n-player general sum games. Perhaps the most well-known example of this is Pluribus (Brown and Sandholm 2019), the algorithm that beat the top human players in multiplayer poker using the same techniques…”
InfluentialScrofaZero: Mastering Trick-taking Poker Game Gongzhu by Deep Reinforcement LearningPreprint
Shi, N., Li, R., & Youran, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.07495 · Cited by 1
“Recently, people proposed counterfactual regret minimization related algorithms (Zinkevich et al., 2007; Brown & Sandholm, 2019) that can be proved to find an -Nash equilibrium.”
Background
Metadata
- Authors
- Brown, N., & Sandholm, T.
- Affiliations
- Meta (United States) (US)
- Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
- Corresponding author
- Brown, Noam
- Venue
- Science
- Published
- 2019-08-30
- Volume
- 365
- Issue
- 6456
- Pages
- 885-890
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2960876848
- Cited by
- 592
- References
- 24
- Citations by year
- 2026: 34 · 2025: 77 · 2024: 81 · 2023: 83 · 2022: 88 · 2021: 125 · 2020: 77 · 2019: 27
- FWCI
- 36.15
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- Funders
- National Science Foundation (1718457, 1617590, 1733556)
- Army Research Office (W911NF-17-1-0082)
- NSF XSEDE (CCR090023)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- no-limit Texas Hold'Em, game AI, human-machine comparison
- MeSH terms
- Games, Recreational, Artificial Intelligence, Game Theory, Humans
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.