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 101–200 of 679
Path sampling of recurrent neural networks by incorporating known physics
Tsai, S.-T., Fields, E., Xu, Y., Kuo, E.-J., & Tiwary, P. (2022) · Nature Communications · doi:10.1038/s41467-022-34780-x · Cited by 48
“For a large system, directly solving (11) is a formidable task.”
BackgroundForecasting AI Progress: Evidence from a Survey of Machine Learning ResearchersPreprint
Zhang, B., Dreksler, N., Anderljung, M., Kahn, L., Giattino, C., Dafoe, A., & Horowitz, M. C. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.04132 · Cited by 44
“Two AI milestones have been achieved since the 2016 respondents made their predictions: DeepMind’s Agent57 (Badia et al., 2020) beat the human Atari benchmark (published in March 2020) and Facebook and Carnegie Mellon’s Pluribus (Brown and Sandholm, 2019) beat top human poker players at Texas hold ’em (published in Ju…”
BackgroundA Formal Model for Multiagent Q-Learning Dynamics on Regular Graphs
Chu, C., Li, Y., Liu, J., Hu, S., Li, X., & Wang, Z. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/28 · Cited by 36
Revealing the impact of expertise on human planning with a two-player board gamePreprint
van Opheusden, B., Galbiati, G., Kuperwajs, I., Bnaya, Z., li, Y., & Ma, W. J. (2021) · PsyArXiv (OSF Preprints) · doi:10.31234/osf.io/rhq5j · Cited by 40
“Additionally, we note that 4-in-a-row, chess and Go are all deterministic two-player games, and expertise in planning with stochastic environments[51] or multi-agent interaction[52] might involve other computational mechanisms.”
BackgroundArtificial Intelligence Explained for Nonexperts
Razavian, N., Knöll, F., & Geras, K. J. (2020) · Seminars in Musculoskeletal Radiology · doi:10.1055/s-0039-3401041 · Cited by 39
“A few recent publications on AlphaGo, 10 Poker, 11 or several strategic video games 12,13 all rely on reinforcement learning to learn to take actions that lead to winning the game.”
A Survey of Planning and Learning in Games
Duarte, F. F., Lau, N., Pereira, A., & Reis, L. P. (2020) · Applied Sciences · doi:10.3390/app10134529 · Cited by 44
“MCCFR was used to train Pluribus [238], the computer program that achieved above top human professional level play in six-player no-limit Texas hold’em poker, via self-play.”
MethodHuman-Level Performance in No-Press Diplomacy via Equilibrium SearchPreprint
Gray, J., Lerer, A. K., Bakhtin, A., & Brown, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.02923 · Cited by 55
“In order to improve empirical performance, we use linear RM (Brown & Sandholm, 2019a), which weighs updates on iteration t by t .”
BackgroundMethodInfluentialSelf-citationA multi-agent simulator for generating novelty in monopoly
Kejriwal, M., & Thomas, S. (2021) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2021.102364 · Cited by 38
Deep learning applications in games: a survey from a data perspective
Hu, Z., Ding, Y., Wu, R., Li, L., Zhang, R., Hu, Y., Qiu, F., Zhang, Z., Wang, K., Zhao, S., et al. (2023) · Applied Intelligence · doi:10.1007/s10489-023-05094-2 · Cited by 40
“…and their combinations include the superhuman agents for board games such as the AlphaGo family for Go [123, 124], Libratus [11] and Pluribus [12] for Texas Hold’em , Suphx for Mahjong [73], DeepNash for Stratego [102], and those for complex video games, such as the OpenAI Five agent for…”
Self-play reinforcement learning with comprehensive critic in computer games
Liu, S., Cao, J., Wang, Y., Chen, W., & Liu, Y. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.006 · Cited by 39
General intelligence disentangled via a generality metric for natural and artificial intelligence
Hernández‐Orallo, J., Loe, B. S., Cheke, L. G., Martínez‐Plumed, F., & hÉigeartaigh, S. Ó. (2021) · Scientific Reports · doi:10.1038/s41598-021-01997-7 · Cited by 48
A survey of decision making in adversarial games
Li, X., Meng, M., Hong, Y., & Chen, J. (2024) · Science China Information Sciences · doi:10.1007/s11432-022-3777-y · Cited by 36
“On the other hand, multi-player II-ZSGs are more challenging and thus have been less researched except for a handful of works, for example, Pluribus [121], the first multi-player poker agent, has defeated top humans in six-player no-limit Texas Hold’em poker (the most prevalent poker in the world)…”
BackgroundDiscovery of optimal quantum codes via reinforcement learning
Su, V. P., Cao, C., Hu, H.-Y., Yanay, Y., Tahan, C., & Swingle, B. G. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034048 · Cited by 43
“As a baseline, we compare to näıve code concatenation, requiring five copies of the base code, that yields a distance [[21, 1, 4]] code (Fig.”
MethodPerformance assessment methodology for AI-supported decision-making in production management
Burggräf, P., Wagner, J., Koke, B., & Bamberg, M. (2020) · Procedia CIRP · doi:10.1016/j.procir.2020.03.047 · Cited by 32
RetroGraph: Retrosynthetic Planning with Graph Search
Xie, S., Yan, R., Han, P., Xia, Y., Wu, L., Guo, C., Yang, B., & Qin, T. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539446 · Cited by 56
“Reinforcement learning based methods have achieved significant results on many conventional games such as GO [31, 32], chess [31], poker [4], and mahjong [24].”
MethodExploring Large Language Models for Communication Games: An Empirical Study on Werewolf
Xu, Y., Wang, S., Li, P., Luo, F., Wang, X., Liu, W., & Liu, Y. (2023) · arXiv · doi:10.48550/arxiv.2309.04658 · Cited by 32
Negotiation and honesty in artificial intelligence methods for the board game of Diplomacy
Kramár, J., Eccles, T., Gemp, I., Tacchetti, A., McKee, K. R., Malinowski, M., Graepel, T., & Bachrach, Y. (2022) · Nature Communications · doi:10.1038/s41467-022-34473-5 · Cited by 66
The Power of Exploiter: Provable Multi-Agent RL in Large State SpacesPreprint
Jin, C., Liu, Q., & Yu, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03352 · Cited by 31
“Multi-agent reinforcement learning (MARL) systems have recently achieved significant success in many AI challenges including the game Go (Silver et al., 2016; 2017), Poker (Brown & Sandholm, 2019), real-time strategy games (Vinyals et al., 2019; OpenAI, 2018), decentralized controls or multiagent robotics systems (Bra…”
BackgroundA Survey on Noncooperative Games and Distributed Nash Equilibrium Seeking over Multi-Agent Networks
Yi, P., Lei, J., Li, X., Liang, S., Meng, M., & Chen, J. (2022) · CAAI Artificial Intelligence Research · doi:10.26599/air.2022.9150002 · Cited by 30
Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
Yan, Y., Li, G., Chen, Y., & Fan, J. (2024) · Operations Research · doi:10.1287/opre.2022.0342 · Cited by 42
Naikar, N., Brady, A., Moy, G., & Kwok, H.-W. (2023) · Ergonomics · doi:10.1080/00140139.2023.2281898 · Cited by 34
“…levels on a number of constrained tasks in fields as diverse as image recognition (He et al. 2015), image generation (Elasri et al. 2022), natural language processing (Brown et al. 2020; Khurana et al. 2023; Zhao 2023), and decision making in games (Brown and Sandholm 2019; Vinyals et al. 2019).”
BackgroundNeural Replicator DynamicsPreprint
Hennes, D., Morrill, D., Omidshafiei, S., Munos, R., Pérolat, J., Lanctot, M., Gruslys, A., Lespiau, J.-B., Parmas, P., Duenez-Guzman, E., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.00190 · Cited by 33
“havior and potential failure modes. In partially-observable zero-sum games, such as poker, traditional approaches using expert knowledge or search with a perfect model have scaled to very large games [8, 11, 12, 51]. However, there have been RL-inspired advances as well: for example Regression Counterfactual Regret Mi…”
Combinatorial Q-Learning for Dou Di Zhu
You, Y., Li, L., Guo, B., Wang, W., & Lu, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v16i1.7445 · Cited by 32
“Likewise, for Pluribus (Brown and Sandholm 2019), it only considers a few (1-14) different bet sizes at any given decision point.”
BackgroundВарламов, О. О., & Aladin, D. V. (2024) · Machine Intelligence Research · doi:10.1007/s11633-023-1473-1 · Cited by 27
AI surpasses humans at six-player poker
Blair, A., & Saffidine, A. (2019) · Science · doi:10.1126/science.aay7774 · Cited by 27
Deception in Social Learning: A Multi-Agent Reinforcement Learning PerspectivePreprint
Chelarescu, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05402 · Cited by 27
“Algorithms such as counterfactual regret minimization have been applied to this framework with great success, for both two-player [Brown and Sandholm, 2018] and multi-player games [Brown and Sandholm, 2019].”
MethodMachine learning for fast development of advanced energy materials
Farhadi, B., You, J., Zheng, D., Liu, L., Wu, S., Li, J., Li, Z., Wang, K., & Liu, S. F. (2023) · Next Materials · doi:10.1016/j.nxmate.2023.100025 · Cited by 31
Direct Human-AI Comparison in the Animal-AI Environment
Voudouris, K., Crosby, M., Beyret, B., Hernández‐Orallo, J., Shanahan, M., Halina, M., & Cheke, L. G. (2022) · Frontiers in Psychology · doi:10.3389/fpsyg.2022.711821 · Cited by 28
“, 2017), Dota 2 (OpenAI, 2018), StarCraft II (DeepMind, 2019), and multiplayer no-limit Texas hold’em poker (Brown and Sandholm, 2019).”
Forbidden knowledge in machine learning reflections on the limits of research and publication
Hagendorff, T. (2020) · AI & Society · doi:10.1007/s00146-020-01045-4 · Cited by 36
“For instance, a 2019 publication (Brown and Sandholm 2019) demonstrated how “Pluribus”, an AI based software, is stronger than professional human players in six-player no-limit Texas hold’em poker.”
BackgroundInfluentialDeep Latent Competition: Learning to Race Using Visual Control Policies in Latent SpacePreprint
Schwarting, W., Seyde, T., Gilitschenski, I., Liebenwein, L., Sander, R., Karaman, S., & Rus, D. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.09812 · Cited by 40
“Multi-agent RL Recently, MARL agents have surpassed human-level performance in many multiagent environments including complex board and card games such as Go [19], chess, shogi [20], and Poker [21, 22].”
BackgroundZeng, J., Hu, L., Pan, Y., Huang, Z., Sun, H., Zeng, J., Xie, X., & Chen, H. (2025) · Advanced Functional Materials · doi:10.1002/adfm.202508292 · Cited by 25
Deep Reinforcement Learning for Fluid Mechanics: Control, Optimization, and Automation
Kim, I., Jeon, Y., Chae, J., & You, D. (2024) · Fluids · doi:10.3390/fluids9090216 · Cited by 23
Tree Broad Learning System for Small Data Modeling
Xia, H., Tang, J., Yu, W., & Qiao, J. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216788 · Cited by 23
“…a high-efficiency, high-precision, and robust model, when trained using small data for regression modeling tasks [10], [11], [12], is fundamental and a far-reaching problem for the practical application of artificial intelligence [13] and the exploration of new machine learning mechanisms [14].”
BackgroundThe Advantage Regret-Matching Actor-CriticPreprint
Gruslys, A., Lanctot, M., Munos, R., Timbers, F., Schmid, M., Perolat, J., Morrill, D., Zambaldi, V., Lespiau, J.-B., Schultz, J., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.12234 · Cited by 28
“One particular approach, counterfactual regret (CFR) minimization [39], has been the core algorithm behind super-human play in Computer Poker research [4, 29, 6, 8].”
Generative AI and the social functions of educational assessment
Broadfoot, P., & Rockey, J. C. (2025) · Oxford Review of Education · doi:10.1080/03054985.2025.2455549 · Cited by 24
“Even though the intricacies of bluff and counterbluff in that game are hard, AI is already better than all but the very best players in the world (Brown & Sandholm, 2019).”
Neural Replicator Dynamics: Multiagent Learning via Hedging Policy Gradients
Hennes, D., Morrill, D., Omidshafiei, S., Munos, R., Pérolat, J., Lanctot, M., Gruslys, A., Lespiau, J.-B., Parmas, P., Duéñez‐Guzmán, E. A., et al. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/gjmw6851 · Cited by 77
“In partially-observable zero-sum games, such as poker, traditional approaches using expert knowledge or search with a perfect model have scaled to very large games [8, 11, 12, 51].”
A community-powered search of machine learning strategy space to find NMR property prediction models
Bratholm, L. A., Gerrard, W., Anderson, B., Bai, S., Choi, S., Dang, L., Hanchar, P., Howard, A., Kim, S., Kolter, J. Z., et al. (2021) · PLoS ONE · doi:10.1371/journal.pone.0253612 · Cited by 25
From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces
Dagan, Y., Daskalakis, C., Fishelson, M., & Golowich, N. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649681 · Cited by 25
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating FunctionsPreprint
Farina, G., Kroer, C., & Sandholm, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.10906 · Cited by 45
Self-citationOsmotic Cloud-Edge Intelligence for IoT-Based Cyber-Physical Systems
Loseto, G., Scioscia, F., Ruta, M., Gramegna, F., Ieva, S., Fasciano, C., Bilenchi, I., & Loconte, D. (2022) · Sensors · doi:10.3390/s22062166 · Cited by 25
“The concurrent evolution of Artificial Intelligence (AI) methods and technologies makes it possible to simulate increasingly accurate rational behavior in machines by learning from data, outperforming expert human professionals in a growing number of tasks [2].”
BackgroundThe scientific events that shaped the decade
(2019) · Nature · doi:10.1038/d41586-019-03857-x · Cited by 21
Sun, Y., Yuan, B., Zhang, T., Tang, B., Zheng, W., & Zhou, X. (2020) · Electronics · doi:10.3390/electronics9101668 · Cited by 20
“Round-robin confrontation is closer to the AI achieved by AlphaGo, and it is easier to solve the problems of micro-strategy modeling and macro-strategy modeling, so it is easier to achieve the AI expected by AlphaGo than RTS games [19–22].”
MethodTechniques and Paradigms in Modern Game AI Systems
Lu, Y., & Li, W. (2022) · Algorithms · doi:10.3390/a15080282 · Cited by 21
“Their team later built Pluribus in 2019, achieving superhuman performance in six-player No-Limit Hold’em [7].”
BackgroundMethodInfluentialDeRL: Coupling Decomposition in Action Space for Reinforcement Learning Task
He, Z., Li, J., Wu, F., Shi, H., & Hwang, K. (2023) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2023.3326551 · Cited by 20
“D EEP Reinforcement Learning (DRL), which has the advantage of adapting the high-dimensional state space, quicklyshinesinvariousdomains,suchascontinuouscontrolfor robotics[1],[2],autonomousdriving[3],[4],scheduling[5],[6], MOBAgames[7],[8],[9]andrecommendationsystems[10].”
BackgroundPitfalls (and advantages) of sophisticated large language models
Strasser, A. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-18851-0.00007-x · Cited by 20
Fu, M. C. (2019) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595919400098 · Cited by 20
Bloody Mahjong playing strategy based on the integration of deep learning and XGBoost
Gao, S., & Li, S. (2021) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12031 · Cited by 19
“The incomplete information games mainly include two models, one is CFR (Counterfactual Regret Minimization)[6, 7]algorithms, suchas Cepheus [8],Libratus[9], Pluribus [10] etc., another is deep reinforcement learning algorithms like AlphaStar [11], and OpenAI Five [12].”
MethodMulti-agent actor-critic with time dynamical opponent model
Tian, Y., Kladny, K.-R., Wang, Q., Huang, Z., & Fink, O. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.10.045 · Cited by 21
AI solutions for drafting in Magic: the Gathering
Ward, H. N., Mills, B., Brooks, D. J., Troha, D., & Khakhalin, A. S. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9619100 · Cited by 19
Chadi, M.-A., & Mousannif, H. (2022) · Applied Artificial Intelligence · doi:10.1080/08839514.2022.2031821 · Cited by 24
Humans perceive warmth and competence in artificial intelligencePreprint
McKee, K. R., Bai, X., & Fiske, S. T. (2021) · PsyArXiv (OSF Preprints) · doi:10.31234/osf.io/5ursp · Cited by 20
Machine learning enabling high-throughput and remote operations at large-scale user facilities
Konstantinova, T., Maffettone, P. M., Ravel, B., Campbell, S. I., Barbour, A., & Olds, D. (2022) · Digital Discovery · doi:10.1039/d2dd00014h · Cited by 21
DouZero+: Improving DouDizhu AI by Opponent Modeling and Coach-guided Learning
Zhao, Y., Zhao, J., Hu, X., Zhou, W., & Li, H. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893710 · Cited by 18
“games, including multi-player Texas Hold’em [10], StarCraft [11], DOTA [12] and Japanese Mahjong [13].”
BackgroundAI and WargamingPreprint
Goodman, J. R., Risi, S., & Lucas, S. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.08922 · Cited by 23
“• Counterfactual Regret Minimisation (CFR) has worked exceptionally well in dealing with hidden information and player bluffing in up to 6-player Texas Hold’em Poker [150, 66, 18].”
BackgroundAI IR: Charting International Relations in the Age of Artificial Intelligence
Baele, S. J., Bukhari, I., Whyte, C., Cuomo, S., Jensen, B., Payne, K., & Garcia, E. V. (2024) · International Studies Review · doi:10.1093/isr/viae013 · Cited by 23
Farina, G., Kroer, C., & Sandholm, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16676 · Cited by 16
Self-citationDynamic Adaptation Using Deep Reinforcement Learning for Digital Microfluidic Biochips
Liang, T.-C., Chang, Y.-C., Zhong, Z., Bigdeli, Y., Ho, T.-Y., Chakrabarty, K., & Fair, R. B. (2024) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3633458 · Cited by 17
“In recent years, we have seen progress on the use of deep Reinforcement Learning (RL) to assist sequential decision-making problems, such as games [2, 67, 77], robotics [18], autonomous driving [57, 61, 78], quantitative trading strategies [37], and healthcare systems [46].”
BackgroundEntropy regularized actor-critic based multi-agent deep reinforcement learning for stochastic games
Hao, D., Zhang, D., Shi, Q., & Li, K. (2022) · Information Sciences · doi:10.1016/j.ins.2022.10.022 · Cited by 16
Newall, P. W. S., & Talberg, N. (2023) · Addiction Research & Theory · doi:10.1080/16066359.2023.2179997 · Cited by 18
“:3) ı k et al. 2017; Brown and Sandholm 2018; Newall 2018; Brown and Sandholm 2019).”
BackgroundLimited lookahead in imperfect-information games
Kroer, C., & Sandholm, T. (2020) · Artificial Intelligence · doi:10.1016/j.artint.2019.103218 · Cited by 17
Self-citationOn pitfalls (and advantages) of sophisticated large language modelsPreprint
Strasser, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2303.17511 · Cited by 18
“In other domains, such as game-playing AIs, neural network architectures have led to success (Campbell 2002; Brown & Sandholm 2019; Silver et al. 2016, 2018).”
BackgroundLearning to Resolve Alliance Dilemmas in Many-Player Zero-Sum Games
Hughes, E., Anthony, T. W., Eccles, T., Leibo, J. Z., Balduzzi, D., & Bachrach, Y. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/wuwb6150 · Cited by 23
Value functions for depth-limited solving in zero-sum imperfect-information games
Kovařík, V., Seitz, D., Lisý, V., Rudolf, J., Sun, S., & Ha, K. (2022) · Artificial Intelligence · doi:10.1016/j.artint.2022.103805 · Cited by 17
“The experimental part of the paper (Section 6) focuses on the depth-limited version of counterfactual regret minimization (CFR), an algorithm which seems particularly promising due to its recent successes in poker [1, 2, 8] and other domains [9, 10].”
BackgroundAlign, then memorise: the dynamics of learning with feedback alignment*
Refinetti, M., d’Ascoli, S., Ohana, R., & Goldt, S. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac411b · Cited by 16
Interpretable Autonomous Flight Via Compact Visualizable Neural Circuit Policies
Tylkin, P., Wang, T.-H. J., Palko, K., Allen, R. E., Siu, H. C., Wrafter, D., Seyde, T., Amini, A., & Rus, D. L. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2022.3146555 · Cited by 15
Unlocking the Potential of Deep Counterfactual Value NetworksPreprint
Zarick, R., Pellegrino, B., Brown, N., & Banister, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.10442 · Cited by 15
“However, empirically many of the algorithms perform well in some large-scale games involving more than two players [14].”
BackgroundMethodInfluentialSelf-citationA coevolutionary approach to deep multi-agent reinforcement learning
Klijn, D., & Eiben, A. E. (2021) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3449726.3459576 · Cited by 16
“Self-play proved to be very effective and allowed RL agents to achieve super-human performance in board games [30], poker[4] and many modern video games [2, 37].”
BackgroundModified action decoder using Bayesian reasoning for multi-agent deep reinforcement learning
Du, W., Ding, S., Zhang, C., & Du, S. (2021) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-021-01385-7 · Cited by 15
RARSMSDou: Master the Game of DouDiZhu With Deep Reinforcement Learning Algorithms
Luo, Q., & Tan, T.-P. (2023) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2023.3303251 · Cited by 16
“DigitalObjectIdentifier 10.1109/TETCI.2023.3303251 Bridge [3], Dota 2 [4], StarCraft II [5], multi-player Texas hold’em [6], Mahjong [7], and DouDiZhu [8]).”
BackgroundInfluentialComputing Bayes–Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging
Bichler, M., Fichtl, M., & Oberlechner, M. (2023) · Operations Research · doi:10.1287/opre.2022.0287 · Cited by 14
Ganzfried, S. (2021) · Games · doi:10.3390/g12020047 · Cited by 14
Zhang, B. H., Farina, G., Celli, A., & Sandholm, T. (2022) · Mathematics of Operations Research · doi:10.1287/moor.2022.0226 · Cited by 14
“Moreover, there exist decentralized no-regret learning dynamics guaranteeing that the empirical frequency of play after T rounds is an O ( 1 = ffiffiffiffi T √ ) -approximate EFCE with high probability, and an EFCE almost surely in the limit (Celli et al. [7], Farina et al. [16]).”
Self-citationConglomeration of deep neural network and quantum learning for object detection: Status quo review
Sinha, P. K., & Marimuthu, R. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.111480 · Cited by 16
Will recent advances in AI result in a paradigm shift in Astrobiology and SETI?
Gale, J., Wandel, A., & Hill, H. (2019) · International Journal of Astrobiology · doi:10.1017/s1473550419000260 · Cited by 17
Hindsight and Sequential Rationality of Correlated Play
Morrill, D., D'Orazio, R., Sarfati, R., Lanctot, M., Wright, J. R., Greenwald, A., & Bowling, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16702 · Cited by 14
Correlation in Extensive-Form Games: Saddle-Point Formulation and BenchmarksPreprint
Farina, G., Ling, C. K., Fang, F., & Sandholm, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.12564 · Cited by 53
“[2007]; Farina et al. [2019]; Brown and Sandholm [2019a].”
BackgroundSelf-citationCoordination in Adversarial Sequential Team Games via Multi-Agent Deep Reinforcement LearningPreprint
Celli, A., Ciccone, M., Bongo, R., & Gatti, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.07712 · Cited by 20
“sed fashion (i.e., directly from experience). The same holds true for the techniques recently employed to achieve expert-level poker playing, which are heavily based on poker-specific domain knowledge [43, 8, 9, 10]. There exist model-free variations of FP and CFR [26, 11]. However, these algorithms fail to model coord…”
PokéChamp: an Expert-level Minimax Language AgentPreprint
Karten, S., Nguyen, A. L., & Jin, C. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.04094 · Cited by 17
“Prior work in reinforcement learning has achieved significant success, attaining superhuman performance in a wide range of games, including Chess, Go, and Poker, through extensive imitation learning and self-play (Campbell et al., 2002; Silver et al., 2017, 2016; Brown & Sandholm, 2019, 2018; Vinyals et al., 2019; Ber…”
InfluentialTowards Understanding AI Delegation: The Role of Self-Efficacy and Visual Processing Ability
Westphal, M., Hemmer, P., Vössing, M., Schemmer, M., Vetter, S., & Satzger, G. (2025) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/3696423 · Cited by 16
“Nowadays, the performance of AI models is similar to, and in certain application areas even exceeds the performance of human experts [16, 41, 91].”
Putting machine learning to use in natural resource management—improving model performance
Frey, U. J. (2020) · Ecology and Society · doi:10.5751/es-12124-250445 · Cited by 17
“Examples include complex strategy games like chess and Go (Silver et al. 2017), strategic decisions under uncertainty against human players—e.g., poker (Brown and Sandholm 2019)—or complex cooperative games (Mnih et al. 2015).”
BackgroundKnowledge Acquisition of Self-Organizing Systems With Deep Multiagent Reinforcement Learning
Ji, H., & Jin, Y. (2021) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4052800 · Cited by 19
“Brown and Sandholm developed a superhuman AI model called “ Pluribus ” using a self-play-with-search algorithm and showed that their model was able to defeat top human professionals in six-player-no-limit Texas hold ” em poker [38].”
MethodA Survey on Population-Based Deep Reinforcement Learning
Long, W., Hou, T., Wei, X., Yan, S., Zhai, P., & Zhang, L. (2023) · Mathematics · doi:10.3390/math11102234 · Cited by 18
Option-Aware Adversarial Inverse Reinforcement Learning for Robotic Control
Chen, J., Lan, T., & Aggarwal, V. (2023) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48891.2023.10160374 · Cited by 26
“Reinforcement Learning (RL) has achieved impressive performance in a variety of scenarios, such as games [1], [2], [3] and robotic control [4], [5].”
BackgroundDeep reinforcement learning for propulsive performance of a flapping foil
Bao, Y., Shi, X., Wang, Z., Zhu, H., Srinil, N., Li, A., Zhou, D., & Fan, D. (2023) · Physics of Fluids · doi:10.1063/5.0169982 · Cited by 13
Drafting in Collectible Card Games via Reinforcement Learning
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2020) · Brazilian Symposium on Computer Games and Digital Entertainment (SBGames) · doi:10.1109/sbgames51465.2020.00018 · Cited by 16
“In fact, despite the recent breakthroughs in game-playing AI that led to superhuman performance on games like Go [1] and Texas Hold’em Poker [2], currently, humans remain unchallenged in CCGs.”
BackgroundComputing Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games
Zhang, Y., & An, B. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i02.5610 · Cited by 13
“…PPAD-complete (Chen and Deng 2005) even for 3-player games, but also because the NE is not unique (or not exchangeable) in multiplayer games, which will make it difficult for each player to select a strategy independently and then form an NE with other players’ strategies (Brown and Sandholm 2019).”
BackgroundInfluentialArtificial intelligent disobedience: Rethinking the agency of our artificial teammates
Mirsky, R. (2025) · AI Magazine · doi:10.1002/aaai.70011 · Cited by 12
Bayesian Optimization of Bose-Einstein Condensates
Bakthavatchalam, T. A., Ramamoorthy, S., Sankarasubbu, M., Radha, R., & Sethuraman, V. (2021) · Scientific Reports · doi:10.1038/s41598-021-84336-0 · Cited by 12
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions
Zhang, B. H., & Sandholm, T. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i5.20461 · Cited by 12
Self-citationGratch, J. S. (2023) · Philosophical Transactions of the Royal Society B Biological Sciences · doi:10.1098/rstb.2021.0475 · Cited by 18
“Rather these approaches have been restricted to higher-level cognitive tasks such as learning dialogue strategies [108,118] or playing abstract games like poker [109].”
BackgroundComputing Ex Ante Coordinated Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games
Zhang, Y., An, B., & Černý, J. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16728 · Cited by 13
A Review of Mahjong AI Research
Zheng, Y., & Li, S. (2020) · International Conference on Robotics, Intelligent Control and Artificial Intelligence (RICAI) · doi:10.1145/3438872.3439104 · Cited by 12
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games
Farina, G., Schmucker, R., & Sandholm, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16677 · Cited by 12
Self-citationComputational Models of Mentalizing
González, B., & Chang, L. J. (2021) · Springer eBooks · doi:10.1007/978-3-030-51890-5_15 · Cited by 15
Joint Policy Search for Multi-agent Collaboration with Imperfect InformationPreprint
Tian, Y., Gong, Q., & Jiang, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.06495 · Cited by 12
“om/facebookresearch/jps. 1 Introduction Deep reinforcement learning has demonstrated strong or even super-human performance in many complex games (e.g., Atari [27], Dota 2 [29], Starcraft [41], Poker [5, 4, 28], Find and Seek [1], Chess [8] and Go [33, 35, 38]). While massive computational resources are used, the unde…”
BackgroundPlanning for the Known Unknown: Machine Learning for Human Healthcare Systems
Chen, J. H., & Verghese, A. (2020) · The American Journal of Bioethics · doi:10.1080/15265161.2020.1822674 · Cited by 12
Learned Belief Search: Efficiently Improving Policies in Partially Observable SettingsPreprint
Hu, H., Lerer, A. K., Brown, N., & Foerster, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09086 · Cited by 13
“More recently, belief-based search techniques have been scaled to large games, leading to breakthroughs in poker (Morav ˇ c ´ ık et al., 2017; Brown & Sandholm, 2017; 2019) and the cooperative game Han-abi (Lerer et al., 2020), as well as large improvements in Bridge (Tian et al., 2020).”
BackgroundSelf-citationOptimizing Quantum Variational Circuits with Deep Reinforcement LearningPreprint
Lockwood, O. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03188 · Cited by 16
Regulating Artificial Intelligence
Guerreiro, J., Rebelo, S. T., & Teles, P. (2023) · National Bureau of Economic Research · doi:10.3386/w31921 · Cited by 12
Evaluating & Reducing Deceptive Dialogue From Language Models with Multi-turn RLPreprint
Abdulhai, M., Cheng, R., Shrivastava, A., Jaques, N., Gal, Y., & Levine, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.14318 · Cited by 13
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.