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 301–400 of 679
Risk-Aware Continuous Control with Neural Contextual Bandits
Ayala-Romero, J., Garcia-Saavedra, A., & Pérez-Costa, X. (2023) · AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i19.30083 · Cited by 9
“…in the domain of decision-making learning techniques has garnered considerable attention owing to their extensive applicability in diverse real-world sequential decision-making problems (Silver et al. 2016; Brown and Sandholm 2019; Meta Fundamental AI Research Diplo-macy Team (FAIR) et al. 2022).”
BackgroundGameTable COST action: kickoff report
Piette, É., Crist, W., Soemers, D. J. N. J., Rougetet, L., Courts, S., Penn, T., & Morenville, A. (2024) · ICGA Journal · doi:10.3233/icg-240245 · Cited by 5
“Researchers in this field have primarily focused on achieving strong, superhuman, or optimal levels of play, with tabletop games such as backgammon, checkers, chess, Go, and poker having served as important benchmarks for many decades, leading to landmark results of AI research such as TD-Gammon (Tesauro, 1995), Chinoo…”
Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning
d'Eon, G., Newman, N., & Leyton‐Brown, K. (2024) · ACM Conference on Economics and Computation (EC) · doi:10.1145/3670865.3673644 · Cited by 5
“Initial experimentation revealed that two common performance tricks were helpful: we use the regret matching plus [Tammelin, 2014] algorithm instead of regret matching, and we use linear CFR [Brown and Sandholm, 2019a], which discounts regrets over time so that later iterations have larger impacts.”
Approximating Nash Equilibria in General-Sum Games via Meta-Learning
Sychrovský, D., Solinas, C., MacQueen, R., Wang, K., Wright, J. R., Sturtevant, N., & Bowling, M. (2026) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/sfzs6668 · Cited by 5
Maulidina, F., Rustam, Z., Novita, M., Setiawan, Q. S., & Sagiran, S. (2021) · International Conference on Decision Aid Sciences and Applications (DASA) · doi:10.1109/dasa53625.2021.9682286 · Cited by 5
Ismail, M. S. (2024) · Mathematical Social Sciences · doi:10.1016/j.mathsocsci.2024.03.004 · Cited by 7
“In poker, Brown and Sandholm [4] introduced the first program that achieves superhuman performance in six-player no-limit Texas hold’em.”
BackgroundData Poisoning to Fake a Nash Equilibria for Markov Games
Wu, Y., McMahan, J., Zhu, X., & Xie, Q. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i14.29529 · Cited by 6
Reward Prediction for Representation Learning and Reward Shaping
Hlynsson, H. D., & Wiskott, L. (2021) · International Joint Conference on Computational Intelligence · doi:10.5220/0010640200003063 · Cited by 5
Committing to correlated strategies with multiple leaders
Castiglioni, M., Marchesi, A., & Gatti, N. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2021.103549 · Cited by 5
Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
Lai, J., Weng, L.-C., Peng, X., & Fang, K. (2022) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2022.107448 · Cited by 5
Optimal Policy of Multiplayer Poker via Actor-Critic Reinforcement Learning
Shi, D., Guo, X., Liu, Y., & Fan, W. (2022) · Entropy · doi:10.3390/e24060774 · Cited by 5
“However, it is not clear that playing an equilibrium policy would be wise in multiplayer games so far [14].”
BackgroundMulti-Agent Reinforcement Learning
Plaat, A. (2022) · Springer eBooks · doi:10.1007/978-981-19-0638-1_7 · Cited by 5
Correlation-Based Algorithm for Team-Maxmin Equilibrium in Multiplayer Extensive-Form Games
Zhang, Y., An, B., & Subrahmanian, V. S. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/86 · Cited by 5
“For example, in poker games, several players may form a team and play against the target player, i.e., they have the same goal but take actions independently because communications are not allowed in general poker games [Brown and Sandholm, 2019].”
BackgroundThe optimal strategy against Fictitious Play in infinitely repeated games
Dong, H., & Mu, Y. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902863 · Cited by 5
“The most impressive ones include AlphaGo[1], AlphaZero[2] to play Go or other chess games, DeepStack[3], Libratus[4], Pluribus[5] to play pok-ers, AlphaStar[6] to play StarCraft.”
BackgroundNo limit: AI poker bot is first to beat professionals at multiplayer game
Heaven, D. (2019) · Nature · doi:10.1038/d41586-019-02156-9 · Cited by 5
Efficient Regret Minimization Algorithm for Extensive-Form Correlated EquilibriumPreprint
Farina, G., Ling, C. K., Fang, F., & Sandholm, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.12450 · Cited by 5
“…such as counterfactual regret minimization (CFR) (Zinkevich et al., 2007) and its faster variants (Tammelin et al., 2015; Brown et al., 2017; Brown & Sandholm, 2019a) have emerged as powerful tools for computing Nash equilibria in large extensive-form games, and have been instrumental in…”
MethodSelf-citationProvably Efficient Online Agnostic Learning in Markov Games.Preprint
Tian, Y., Wang, Y., Yu, T., & Sra, S. (2020) · arXiv (Cornell University) · Cited by 5
OpenHoldem: An Open Toolkit for Large-Scale Imperfect-Information Game Research.Preprint
Li, K., Xu, H., Zhang, M., Zhao, E., Wu, Z., Xing, J., & Huang, K. (2020) · arXiv (Cornell University) · Cited by 5
Gidel, G., Balduzzi, D., Czarnecki, W. M., Garnelo, M., & Bachrach, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05820 · Cited by 9
“Externally defined games have been used as benchmarks in artificial intelligence for decades (Samuel, 1959; Tesauro, 1995), with recent progress on increasingly complex domains such as poker (Brown and Sandholm, 2017; 2019), chess, Go (Silver et al., 2017), and StarCraft II (Vinyals et al., 2019).”
MethodDeep Synoptic Monte Carlo Planning in Reconnaissance Blind ChessPreprint
Clark, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.01810 · Cited by 5
Remember and Forget Experience Replay for Multi-Agent Reinforcement LearningPreprint
Weber, P., Wälchli, D., Zeqiri, M., & Koumoutsakos, P. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.13319 · Cited by 12
“More recently Multi-Agent Reinforcement Learning (MARL) has been applied to multiplayer games such as poker [2] and prominent computer games such as Dota 2 and StarCraftII [20, 33].”
OpenSIR: Open-Ended Self-Improving ReasonerPreprint
Kwan, W.-C., Leang, J. O. J., Vougiouklis, P., Pan, J. Z., Valentino, M., & Minervini, P. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.00602 · Cited by 8
“…is to generate synthetic training data through self-play, which demonstrated remarkable success in various games [Silver et al., 2016, 2017, Brown and Sandholm, 2019, FAIR et al., 2022], allowing systems to exceed human-level performance by learning from unambiguous reward signals [Silver…”
Breaking through safety performance stagnation in autonomous vehicles with dense learning
Feng, S., Zhu, H., Sun, H., Yan, X., He, L., Yang, J., Su, G., Li, B., Li, S., Wang, L., et al. (2026) · Nature Communications · doi:10.1038/s41467-026-69761-x · Cited by 11
Behavior imitation of individual board game players
Pan, C.-F., Min, X.-Y., Zhang, H., Song, G., & Min, F. (2022) · Applied Intelligence · doi:10.1007/s10489-022-04050-w · Cited by 4
“In the short term, these agents can increase the attractiveness of board games such as chess [2, 3], Go [4, 5], Reversi [6, 7], Hex [8, 9], Poker [10, 11], Spades [12, 13] and Mahjong [14, 15].”
BackgroundDeep reinforcement learning in medical imaging
Zhou, S. K., & Wang, Q. (2024) · Elsevier eBooks · doi:10.1016/b978-0-32-385124-4.00010-6 · Cited by 6
AI Testing Should Account for Sophisticated Strategic Behaviour
Kovařík, V., Chen, E., Petersen, S., Ghersengorin, A., & Conitzer, V. (2025) · neural information processing systems · doi:10.52202/085713-4912 · Cited by 10
Xu, J., Chen, J., & Chen, S. (2021) · Electronics · doi:10.3390/electronics10172087 · Cited by 4
“They have almost simultaneously put forward AI programs—Libratus (from CMU) [5] and DeepStack (from UoA) [6]—to solve two-player NLTH in 2017, as well as a Superhuman AI—Pluribus (from CMU) for multiplayer NLTH in 2019 [1].”
BackgroundOptimal Decision Strategies for the Generalized Cuckoo Card Game
Mignoni, N., Carli, R., & Dotoli, M. (2023) · IEEE Transactions on Games · doi:10.1109/tg.2023.3239795 · Cited by 4
“The most recent Poker agents, based on techniques derived from artificial intelligence, have reached superhuman capabilities: in [14], an algorithm called “Pluribus” is presented, shown to be stronger than top human professionals in six-player no-limit Texas hold’em Poker .”
MethodA variable structure multi‐model maneuvering target tracking algorithm based on Monte Carlo learning
Shen-Tu, H., Zhang, H., Zhu, Y., Wu, X., & Long, T. (2023) · IET Radar Sonar & Navigation · doi:10.1049/rsn2.12464 · Cited by 4
PokerKit: A Comprehensive Python Library for Fine-Grained Multivariant Poker Game Simulations
Kim, J.-H. (2023) · IEEE Transactions on Games · doi:10.1109/tg.2023.3325637 · Cited by 4
“Pioneering AI agents such as Deepstack and Pluribus have leveraged poker, more specifically Texas hold’em, as a benchmark for evaluating their algorithms [1], [2].”
BackgroundWeighting Information Sets with Siamese Neural Networks in Reconnaissance Blind Chess
Bertram, T., Fürnkranz, J., & Müller, M. (2023) · IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333170 · Cited by 4
“I NTRODUCTION Game AI has achieved superhuman performance in many classic fully observable games such as chess [6], Go [17], and backgammon [20], and recently also showed similar results in the imperfect information game of Poker [5].”
ResultGraph-based Deep Reinforcement Learning for Wind Farm Set-Point Optimisation
Sheehan, H., Poole, D. J., Filho, T. M. S., Bossanyi, E. A., & Landberg, L. (2024) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2767/9/092028 · Cited by 4
The Computational Evolution of Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · doi:10.1093/oso/9780192844835.001.0001 · Cited by 7
Hu, D., Hu, S., Mu, C., Fan, S., Chu, C., Liu, J., & Wang, Z. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3565266 · Cited by 4
“It is well-known that regret minimization and its many variants can guarantee time-average convergence to certain classes of equilibria in games [10], [11].”
A View on Deep Reinforcement Learning in Imperfect Information Games
Pricope, T.-V. (2020) · Studia Universitatis Babeș-Bolyai Informatica · doi:10.24193/subbi.2020.2.03 · Cited by 4
“This is normally the metric to use for addressing performance in Poker, very many articles use this one for their experiments ([21], [7], [5], [3]).”
BackgroundWhat May Lie Ahead in Reinforcement Learning
Cansever, D. H. (2021) · Studies in systems, decision and control · doi:10.1007/978-3-030-60990-0_1 · Cited by 4
Learning the Rules of the Game: An Interpretable AI for Learning How to Play
Aurentz, J. L., Navarro, A. M., & Insua, D. R. (2021) · IEEE Transactions on Games · doi:10.1109/tg.2021.3066245 · Cited by 4
Shifting Perspectives on AI Evaluation: The Increasing Role of Ethics in Cooperation
Barbierato, E., & Zamponi, M. E. (2022) · AI · doi:10.3390/ai3020021 · Cited by 6
“Pluribus [27] is a joint research effort from Facebook and Carnegie Mellon University.”
BackgroundReinforcement learning algorithms for the Untangling of Braids
Khan, A., Vernitski, A., & Lisitsa, A. (2022) · Proceedings of the ... International Florida Artificial Intelligence Research Society Conference · doi:10.32473/flairs.v35i.130657 · Cited by 4
“Recent success of reinforcement learning (RL) in many interesting problems, such as playing the game of Go (Silver et al., 2017), playing card games (Brown and Sandholm, 2019), and autonomous driving (Shalev-Shwartz et al., 2016) mostly involve the participation of more than one single…”
BackgroundLing, B., Liu, X., Jiang, J. P., Wu, W., Wang, W., Lyu, Y., & Xu, X. (2022) · Communications in computer and information science · doi:10.1007/978-981-19-6135-9_3 · Cited by 4
Kdb-D2CFR: Solving Multiplayer imperfect-information games with knowledge distillation-based DeepCFR
Li, H., Guo, Z., Liu, Y., Wang, X., Qi, S., Zhang, J., & Xiao, J. Z. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.110567 · Cited by 4
Anagnostides, I., Panageas, I., Farina, G., & Sandholm, T. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i9.28799 · Cited by 4
Self-citationContested Logistics: A Game-Theoretic Approach
Černý, J., Ling, C. K., Chakrabarti, D., Zhang, J., Farina, G., Kroer, C., & Iyengar, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-74835-6_7 · Cited by 4
Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games
Farina, G., & Pipis, C. (2023) · neural information processing systems · doi:10.52202/075280-1228 · Cited by 4
Drafting in Collectible Card Games via Reinforcement Learning
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2021) · Simpósio Brasileiro de Jogos e Entretenimento Digital (SBGames) · doi:10.5753/sbgames_estendido.2021.19743 · Cited by 4
Ganzfried, S., Laughlin, C., & Morefield, C. (2019) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.1910.00193 · Cited by 4
Almost Optimal Algorithms for Two-player Markov Games with Linear Function Approximation.Preprint
Chen, Z., Zhou, D., & Gu, Q. (2021) · arXiv (Cornell University) · Cited by 4
Double Oracle Algorithm for Computing Equilibria in Continuous Games
Adam, L., Horčík, R., Kasl, T., & Kroupa, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16641 · Cited by 3
Hidden Information General Game Playing with Deep Learning and Search
Partridge, Z., & Thielscher, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20868-3_12 · Cited by 3
Complete DouDizhu Agents: Bid Learning from Pretrained Cardplay
Li, C., Troillet, L., & Matsuzaki, K. (2023) · IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333190 · Cited by 3
“Imperfect information games have recently been the center of attention, and multiple researches created agents to master various imperfect information games such as no-limit Texas hold’em [1], Hanabi [2], Mahjong [3], StarCraft II [4].”
BackgroundGambling as Work: A Study of German Poker Players
Weidner, L. (2023) · Journal of Gambling Studies · doi:10.1007/s10899-023-10277-0 · Cited by 3
“At first only in heads-up (1v1) games (Brown & Sandholm, 2018) but the latest versions are even successful in multiplayer games (Brown & Sandholm, 2019).”
BackgroundShaping Social Robot to Play Games with Human Demonstrations and Evaluative Feedback
Zheng, C., Zhang, L., Wang, H., Gómez, R., Nichols, E., & Li, G. (2024) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra57147.2024.10611605 · Cited by 3
“Superhuman performance has also been demonstrated in imperfect information games—Texas hold’em no-limit poker [12].”
BackgroundDominitz, J., & Manski, C. F. (2026) · Theory and Decision · doi:10.1007/s11238-026-10150-7 · Cited by 3
“Much past research has described so-called superhuman artificial intelligence (AI) systems in specific contexts, such as a “superhuman AI program” for playing Go (Silver et al., 2017; Shin et al., 2023) and a “superhuman AI” poker player (Brown and Sandholm, 2019).”
Learning multi-agent cooperation
Rivera, C. G., Staley, E. W., & Llorens, A. J. (2022) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2022.932671 · Cited by 3
“Hence, many RL breakthroughs to date have focused on gaming and other applications with structured and predictable environments (Silver et al., 2016; Brown and Sandholm, 2019; Vinyals et al., 2019).”
BackgroundReinforcement Learning with Decoupled State Representation for Robot Manipulations
Dong, K., Zeng, Y., Wang, K., Luo, Y., Wang, Y., Cheng, E., Sun, Z., Zhang, Q., & Song, B. (2024) · Neural Processing Letters · doi:10.1007/s11063-024-11650-9 · Cited by 3
Effective theory of collective deep learning
Arola-Fernández, L., & Lacasa, L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l042040 · Cited by 3
Puck tracking system for aerohockey game with YOLO2
Tolmacheva, A. E., Ogurtsov, D., & Dorrer, M. G. (2019) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1399/3/033116 · Cited by 3
Gruetzemacher, R. R. (2020) · Cited by 3
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games
Zhang, B. H., & Sandholm, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16724 · Cited by 18
Self-citationNiklaus, J., Alberti, M., Ingold, R., Stolze, M., & Koller, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61534-5_45 · Cited by 3
Computing an Optimal Pitching Strategy in a Baseball At-Bat
Douglas, C., Witt, E., Bendy, M., & Vorobeychik, Y. (2023) · Proceedings of the ... International Florida Artificial Intelligence Research Society Conference · doi:10.32473/flairs.36.133346 · Cited by 3
Cazenave, T., Legras, S., & Ventos, V. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9619088 · Cited by 3
“Other approaches to imperfect information games are Information Set Monte Carlo Tree Search [7], counterfactual regret minimization that solved Poker [8], [9], and Exploitability Descent [10].”
BackgroundGuan, M., Wu, Z. P., Yang, W., Guo, B., Cao, X., & Chen, H. (2022) · Mobile Networks and Applications · doi:10.1007/s11036-021-01874-7 · Cited by 3
Fictitious Play with Maximin Initialization
Ganzfried, S. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992424 · Cited by 3
“’em that defeated strong human professionals [21]; however there are no guarantees on its convergence to equilibrium, and it was shown to not converge to equilibrium in the simplified game of three-player Leduc hold ’em [22].”
BackgroundHadiyanto, M. Y., Harsono, B., & Karnadi, I. (2023) · Advance Sustainable Science Engineering and Technology · doi:10.26877/asset.v6i1.17562 · Cited by 3
Decentralized multi-agent cooperation via adaptive partner modeling
Xu, C., Wang, J., Zhu, X., Yue, Y., Zhou, W., Liang, Z., & Wojtczak, D. (2024) · Complex & Intelligent Systems · doi:10.1007/s40747-024-01421-3 · Cited by 3
The Ethics of Life as It Could Be: Do We Have Moral Obligations to Artificial Life?
Witkowski, O., & Schwitzgebel, E. (2024) · Artificial Life · doi:10.1162/artl_a_00436 · Cited by 8
“Current AI systems outperform even expert humans in games, such as chess, Go, and poker (N. Brown & Sandholm, 2019; Campbell et al., 2002; Silver et al., 2018; Silver et al., 2017), and in practical domains, such as lung cancer screening (Ardila et al., 2019), predicting protein structure (Jumper…”
BackgroundZero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria
Kalogiannis, F., & Panageas, I. (2023) · neural information processing systems · doi:10.52202/075280-2621 · Cited by 3
Learning to Play Imperfect-Information Games by Imitating an Oracle Planner
Boney, R., Ilin, A., Kannala, J., & Seppänen, J. (2021) · IEEE Transactions on Games · doi:10.1109/tg.2021.3067723 · Cited by 3
Multi-Agent Reinforcement Learning for Distributed Cooperative Targets Search
Sun, Y., Wu, Z., Zhang, Q., Shi, Z., & Zhong, Y. (2021) · IEEE International Conference on Unmanned Systems (ICUS) · doi:10.1109/icus52573.2021.9641124 · Cited by 3
Lakemeyer, G. (2022) · Springer eBooks · doi:10.1007/978-3-662-64448-5_36 · Cited by 3
Value Functions for Depth-Limited Solving in Imperfect-Information GamesPreprint
Kovařík, V., Seitz, D., Lisý, V., Rudolf, J., Sun, S., & Ha, K. (2019) · arXiv (Cornell University) · Cited by 3
Public Information Representation for Adversarial Team GamesPreprint
Carminati, L., Cacciamani, F., Ciccone, M., & Gatti, N. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2201.10377 · Cited by 3
Deep Watermarking for Deep Intellectual Property Protection: A Comprehensive SurveyPreprint
Sun, Y., Liu, L., Yu, N., Liu, Y., Tian, Q. C., & Guo, D. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4697020 · Cited by 7
The Complexity of Two-Team Polymatrix Games with Independent AdversariesPreprint
Hollender, A., Maystre, G., & Nagarajan, S. G. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2409.07398 · Cited by 3
“…agent interactions and has found many applications in the modern AI landscape such as Generative Adversarial Networks [GPAM + 20], obtaining agents with expert level play in multiplayer games such as Starcraft and Quake III [VBC + 19, JCD + 19] and superhuman performance in poker [BS18, BS19].”
BackgroundHow ChatGPT affects Scientific Publication: an Empirical study on EFL authorsPreprint
Liang, Y., Yang, T., & Zhu, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4992755 · Cited by 3
AI Finds A WayPreprint
Dharna, A., Lu, C., Sullivan, R., Lehman, J., Krakovna, V., & Clune, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.23875 · Cited by 3
A Logarithmic Regret Bound for Optimistic Hedge in General-Sum GamesPreprint
Ha, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.19677 · Cited by 3
“The same question arises in poker self-play (Brown & Sandholm, 2019), adversarial training (Goodfellow et al., 2014), and language-model alignment (Munos et al., 2024; Wu et al., 2026).”
Safe Search for Stackelberg Equilibria in Extensive-Form Games
Ling, C. K., & Brown, N. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16697 · Cited by 4
Self-citationDecision Making in Monopoly Using a Hybrid Deep Reinforcement Learning Approach
Parihar, H., & Suman, M. (2024) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2024.58270 · Cited by 2
Communication with factorized policy gradients in multi-agent deep reinforcement learning
Zhu, C., Dastani, M. M., & Wang, S. (2025) · Neural Computing and Applications · doi:10.1007/s00521-025-11272-9 · Cited by 2
“Multi-agent deep reinforcement learning (MADRL) holds considerable promise to help address a variety of multi-agent problems, such as autonomous driving [1], sensor networks [2], robotics [3], and game-playing [4, 5].”
Xiao, J., Qiu, C., Xu, Y., Zhang, J., Qi, S., & Wang, X. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.129496 · Cited by 2
SpinGPT: A Large-Language-Model Approach to Playing Poker Correctly
Maugin, N., & Cazenave, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-23657-9_8 · Cited by 2
Study on the Play Strategy of Dou Dizhu Poker Based on Convolution Neural Network
Li, S., Wu, R., & Bo, J. (2019) · International Conference on Ubiquitous Computing and Communications (IUCC) · doi:10.1109/iucc/dsci/smartcns.2019.00145 · Cited by 2
“The hand cards of Dou Dizhu (also known as "two to one") players are hidden information , and the opening situation will also change because of the status and the bottom cards, and the interest relationship between players also changes with the differenbangt status [7].”
BackgroundTrembling-Hand Perfection and Correlation in Sequential Games
Marchesi, A., & Gatti, N. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16700 · Cited by 2
Agent Decision Processes Using Double Deep Q-Networks + Minimax Q- Learning
Fitch, N., & Clancy, D. J. (2021) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero50100.2021.9438149 · Cited by 2
“In general, optimal strategic game play in more complex game environments such as six-player, no-limit Texas hold'em poker [8] and Go [9] have been essentially solved by deep neural networks trained using reinforcement learning.”
BackgroundRen, J., Zhang, Y., Zeng, Y., & Lan, Y. (2021) · IEEE International Conference on Real-time Computing and Robotics (RCAR) · doi:10.1109/rcar52367.2021.9517647 · Cited by 2
Scalable sub-game solving for imperfect-information games
Li, H., Wang, X., Li, K., Jia, F., Wu, Y., Zhang, J., & Qi, S. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.107434 · Cited by 2
Kyllonen, P. C. (2021) · Educational research and innovation · doi:10.1787/feecd512-en · Cited by 3
Yuan, W., Hu, Z., Luo, J., Xu, J., Ji, X., Shaofei, C., Zhang, W., & Chen, J. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9727939 · Cited by 2
A Neuroevolutionary Approach for Opponent Modeling and Exploitation in No-limit Texas Hold’em Poker
Xu, J., & Chen, S. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9727922 · Cited by 2
“They have simultaneously put forward AI programs——Libratus(from CMU) [4] and DeepStack(from UoA) [5] to solve Heads-Up No-Limit Texas Hold’em poker in 2017, as well as a Superhuman AI——Pluribus(from CMU) for multiplayer Texas Hold’em poker in 2019 [1].”
BackgroundInfluentialApplication of Reinforcement Learning in Multiagent Intelligent Decision-Making
Han, X. (2022) · Computational Intelligence and Neuroscience · doi:10.1155/2022/8683616 · Cited by 2
“Noam Brown and others combined CFR with deep neural networks to propose a deeper virtual regret minimum algorithm (DCFR [16]).”
BackgroundTowards Modern Card Games with Large-Scale Action Spaces Through Action Representation
Yao, Z., Shi, T., Li, S., Xie, Y., Qin, Y., Xie, X., Lu, H., & Zhang, Y. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893589 · Cited by 3
“Prior works have proposed RL methods to approach a number of traditional card games, like Texas Hold’em [6]–[8], Mahjong [9], DouDizhu [5], [10], etc.”
MethodGenetic Programming + Multi-Agent Reinforcement Learning: Hybrid Approaches for Decision Processes
Fitch, N., & Clancy, D. J. (2022) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero53065.2022.9843637 · Cited by 2
Evidence Based Pipeline for Explaining Artificial Intelligence Algorithms with Interactions
Hanif, A., Beheshti, A., Benatallah, B., Zhang, X., & Wood, S. (2022) · IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa54385.2022.10032417 · Cited by 4
“From human players’ defeat in various complex games [1]–[3] to the progress in identifying the early diagnosis of diseases in the patients [4]–[6], there are many examples of AI success.”
BackgroundLearning to Play Koi-Koi Hanafuda Card Games With Transformers
Guan, S., Wang, J., Zhu, R., Qian, J., & Wei, Z. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3240674 · Cited by 2
“Typical works include DeepStack [8], Libratus [24], and Pluribus [25] for no-limit Texas Hold’em .”
BackgroundSolving Optimization Problems with Blackwell Approachability
Grand-Clément, J., & Kroer, C. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2023.1376 · Cited by 2
Towards sample efficient deep reinforcement learning in collectible card games
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2023) · Entertainment Computing · doi:10.1016/j.entcom.2023.100594 · Cited by 2
Mixture of Public and Private Distributions in Imperfect Information Games
Arjonilla, J., Saffidine, A., & Cazenave, T. (2023) · IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333169 · Cited by 2
“Chess, Go [1]– [3], Poker [4], Skat, Contract Bridge or Dota [5] are among the most famous ones.”
BackgroundCheat-FlipIt: An Approach to Modeling and Perception of a Deceptive Opponent
Yao, Q., Xiong, X., & Wang, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8664-4_21 · Cited by 2
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.