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 201–300 of 679
Kong, H., Xing, Q., Wang, Q., Niu, R., Chen, H., Wang, Y., Wang, S., Duan, Z., & Chang, Y. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3562302 · Cited by 13
The $$\alpha \mu $$ Search Algorithm for the Game of Bridge
Cazenave, T., & Ventos, V. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-89453-5_1 · Cited by 11
Recursive Monte Carlo Search for Bridge Card Play
Bouzy, B., Rimbaud, A., & Ventos, V. (2020) · IEEE Conference on Games (CoG) · doi:10.1109/cog47356.2020.9231667 · Cited by 11
“Poker is the most famous IIG for which artificial intelligence is already successful [2].”
BackgroundParallel Droplet Control in MEDA Biochips using Multi-Agent Reinforcement Learning
Liang, T.-C., Zhou, J., Chan, Y. C., Ho, T.-Y., Chakrabarty, K., & Lee, C. (2021) · International Conference on Machine Learning · Cited by 11
Toward Automated Game Balance: A Systematic Engineering Design Approach
DeLaurentis, D. A., Panchal, J. H., Raz, A. K., Balasubramani, P., Maheshwari, A., Dachowicz, A. P., & Mall, K. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9619032 · Cited by 11
“Knowledge transfer from the gaming industry to engineering and design has gained attention in recent years as ground-breaking developments have been made with the advent of superhuman AI players such as AlphaStar [1], Pluribus [2], etc., that have beaten the best human players in the world.”
BackgroundCombining No-regret and Q-learning
Kash, I. A., Sullins, M., & Hofmann, K. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/fupd5844 · Cited by 11
Empirical Analysis of Fictitious Play for Nash Equilibrium Computation in Multiplayer Games
Ganzfried, S. (2025) · Proceedings of the ... International Florida Artificial Intelligence Research Society Conference · doi:10.32473/flairs.38.1.138636 · Cited by 12
“Despite a lack of a significant theoretical guarantee, CFR was combined with subgame solving [20] and depth-limited search [9], [25] to produce a superhuman agent for multiplayer poker [8].”
BackgroundReal-time tree search with pessimistic scenariosPreprint
Osogami, T., & Takahashi, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10870 · Cited by 11
“our small windows on the right most column respectively denote the areas that the four agents can observe. Chess [Campbell et al.], Atari video games [Mnih et al., 2015], Poker [Bowling et al., 2015; Brown and Sandholm, 2019], and Go [Silver et al., 2017]. Pommerman has its own diculty that prohibits eective applicati…”
AI Watch: Assessing Technology Readiness Levels for Artificial IntelligencePreprint
Fernando, M. P., Emilia, G. G., & Hernández‐Orallo, J. (2020) · RePEc: Research Papers in Economics · doi:10.2760/15025 · Cited by 16
Multi-Agent Training beyond Zero-Sum with Correlated Equilibrium Meta-SolversPreprint
Marris, L., Müller, P. F., Lanctot, M., Tuyls, K., & Graepel, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09435 · Cited by 33
“…tackling two-player, constant-sum games (Silver et al., 2016; Vinyals et al., 2019) has outpaced progress in n-player, general-sum games despite a lot of interest (Jaderberg et al., 2019; Berner et al., 2019; Brown & Sandholm, 2019; Lockhart et al., 2020; Gray et al., 2020; Anthony et al., 2020).”
BackgroundComputing Bayes Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging
Bichler, M., Fichtl, M., & Oberlechner, M. (2023) · ACM Conference on Economics and Computation (EC) · doi:10.1145/3580507.3597713 · Cited by 11
Multi-Agent Risks from Advanced AI
Hammond, L., Chan, A., Clifton, J., Hoelscher-Obermaier, J., Khan, A., McLean, E., Smith, C., Barfuss, W., Foerster, J., Gavenčiak, T., et al. (2025) · arXiv · doi:10.48550/arxiv.2502.14143 · Cited by 305
A Survey of Human Intelligence Augmented Artificial Intelligence: An Autonomous Driving Perspective
Li, S., Yuan, K., Tang, Z., Zhang, Y., Ji, P., Ge, Q., Du, S., Huang, Y., & Chen, H. (2025) · Automotive Innovation · doi:10.1007/s42154-025-00361-z · Cited by 13
“Superhuman AI [210, 211] has been impactful in domains such as chess.”
Scalable decision-making for games of imperfect information
Sokota, S., Vinitsky, E., Hu, H., Fan, Z., Kolter, J. Z., & Farina, G. (2026) · Nature · doi:10.1038/s41586-026-11036-y · Cited by 11
Supervised and Reinforcement Learning from Observations in Reconnaissance Blind Chess
Bertram, T., Fürnkranz, J., & Müller, M. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893588 · Cited by 10
Putting Chemical Knowledge to Work in Machine Learning for Reactivity
Jorner, K. (2023) · CHIMIA International Journal for Chemistry · doi:10.2533/chimia.2023.22 · Cited by 10
Yang, S., Barlow, M., Townsend, T., Liu, X., Samarasinghe, D., Lakshika, E., Moy, G., Lynar, T., & Turnbull, B. (2023) · IEEE Access · doi:10.1109/access.2023.3287100 · Cited by 13
“…Counterfactual Regret Minimization (CFR) algorithms, and/or RL based algorithms have achieved superhuman performance in some imperfect information game with smaller state-action space [9], [12], [25], [26], [27], [28], [29], complex imperfect information games remain an open challenge for AI.”
BackgroundLearning in games: a systematic review
Qin, R.-J., & Yu, Y. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3955-x · Cited by 12
“Pluribus [15] is a mature version of Libratus and Modicum, and is also the first AI applied to play with human players in 6-player Texas Hold’em in 2019.”
BackgroundMulti-agent Imitation Learning with Copulas
Wang, H., Yu, L., Cao, Z., & Ermon, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86486-6_9 · Cited by 10
Eswaran, S., Sachdeva, M., Vimal, V., Seth, D., Kalpam, S., Agarwal, S., Mukherjee, T., & DattaGupta, S. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403316 · Cited by 12
“Most of the literature in the game AI domain focuses on building agents that can learn and predict next moves and effectively 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 Chess, Go, Atari, and…”
MethodNo-Press Diplomacy from ScratchPreprint
Bakhtin, A., Wu, D., Lerer, A. K., & Brown, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.02924 · Cited by 49
“Nevertheless, past work has found that it produces competitive policies that have low exploitability in important non-2p0s games including six-player poker and no-press Diplomacy [9, 11].”
BackgroundResultInfluentialSelf-citationEfficiently Computing Nash Equilibria in Adversarial Team Markov GamesPreprint
Kalogiannis, F., Anagnostides, I., Panageas, I., Vlatakis-Gkaragkounis, E.-V., Chatziafratis, V., & Stavroulakis, S. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.02204 · Cited by 10
“…multi-agent settings has been guided by game-theoretic principles, leading to many recent landmark results in benchmark domains in AI (Bowling et al., 2015; Silver et al., 2017; Vinyals et al., 2019; Moravčík et al., 2017; Brown and Sandholm, 2019, 2018; Brown et al., 2020; Perolat et al., 2022).”
BackgroundLee, E., Slama, R., & Leclercq, L. (2025) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2025.105300 · Cited by 9
Will knowledge building remain uniquely human?
Scardamalia, M., & Bereiter, C. (2020) · Qwerty · doi:10.30557/qw000028 · Cited by 13
Research on Action Strategies and Simulations of DRL and MCTS-based Intelligent Round Game
Sun, Y., Yuan, B., Zhang, Y., Zheng, W., Xia, Q., Tang, B., & Zhou, X. (2021) · International Journal of Control Automation and Systems · doi:10.1007/s12555-020-0277-0 · Cited by 9
Conditional Imitation Learning for Multi-Agent Games
Shih, A., Ermon, S., & Sadigh, D. (2022) · ACM/IEEE International Conference on Human-Robot Interaction (HRI) · doi:10.1109/hri53351.2022.9889671 · Cited by 17
Your Buddy, the Grandmaster: Repurposing the Game-Playing AI Surplus for Inclusivity
Aytemiz, B., Shu, X., Hu, E. J., & Smith, A. M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v16i1.7402 · Cited by 9
“In the videogames domain, the research community made progress towards overcoming several difficult problems: an immense branching factor in Go (Silver and Huang 2016); multiagent communication in DOTA2 (Berner 2019); working with hidden information in poke (Brown and Sandholm 2019); parsing the screen with Atari (Bad…”
BackgroundDiscrete-Time Mean Field Control with Environment States
Cui, K., Tahir, A., Sinzger-D’Angelo, M., & Koeppl, H. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683749 · Cited by 9
Artificial Intelligence's Grand Challenges: Past, Present, and Future
Mani, G. (2021) · AI Magazine · doi:10.1002/j.2371-9621.2021.tb00012.x · Cited by 10
“…human go champion, Lee Sedol (who lost four games, but won one to Alphago in 2016) recently announced his retirement! poker — an imperfect information game, as other players’ cards are hidden — has also seen tremendous advances of late, with machines trumping over humans (Brown and Sandholm 2019).”
BackgroundFarina, G., Kroer, C., & Sandholm, T. (2025) · Operations Research · doi:10.1287/opre.2021.0633 · Cited by 9
Self-citationSolving imperfect-information games via exponential counterfactual regret minimizationPreprint
Li, H., Wang, X., Qi, S., Zhang, J., Liu, Y., Wu, Y., & Jia, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.02679 · Cited by 9
“Pluribus, the latest computer program based on the related CFR method, defeated the top poker player in six-player no-limit Texas Hold’em poker, which is recognized as the milestone in the field of artificial intelligence and game theory [16].”
MethodProvably Efficient Policy Gradient Methods for Two-Player Zero-Sum Markov Games.Preprint
Zhao, Y., Tian, Y., Lee, J. D., & Du, S. S. (2021) · arXiv (Cornell University) · Cited by 9
MAESTRO: Open-Ended Environment Design for Multi-Agent Reinforcement Learning
Samvelyan, M., Khan, A., Dennis, M., Jiang, M., Parker-Holder, J., Foerster, J., Raileanu, R., & Rocktäschel, T. (2023) · arXiv · doi:10.48550/arxiv.2303.03376 · Cited by 8
“Zinkevich et al. (2007) use self-play with regret minimisation for achieving Nash equilibrium, an approach that led to superhuman performance in Poker (Brown & Sandholm, 2018; 2019).”
MethodBridge Bidding via Deep Reinforcement Learning and Belief Monte Carlo Search
Qiu, Z., Wang, S., You, D., & Zhou, M. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124488 · Cited by 8
Model-Free Neural Counterfactual Regret Minimization With Bootstrap Learning
Liu, W., Li, B., & Togelius, J. (2022) · IEEE Transactions on Games · doi:10.1109/tg.2022.3158649 · Cited by 8
“Based on these techniques, the state-of-the-art algorithms for HUNL are Libratus [13] and Pluribus [14].”
MethodReCom: A deep reinforcement learning approach for semi-supervised tabular data labeling
Zaks, G., & Katz, G. (2021) · Information Sciences · doi:10.1016/j.ins.2021.12.076 · Cited by 8
AI-powered mechanisms as judges: Breaking ties in chess
Anbarcı, N., & Ismail, M. S. (2024) · PLoS ONE · doi:10.1371/journal.pone.0305905 · Cited by 8
“(For ranking systems used in Swiss-system tour-naments and a review of these systems, see, e.g., [42, 43]).”
MethodCredible Negotiation for Multi-agent Reinforcement Learning in Long-term Coordination
Gu, T., Zhi, T., Bao, X., & Chang, L. (2025) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/3706110 · Cited by 8
“…with SARL, MARL requires more interactions among agents; thus, it can solve more complex and difficult practical scenarios, e.g., game competition [5, 47], economics [33], the autonomous multi-agent system [3, 8], cooperative robots in production factories [1, 15], and traffic control systems…”
Su, T. H., Shresthamali, S., & Kondo, M. (2025) · Physical Review A · doi:10.1103/5lfr-xb8m · Cited by 11
“By tackling sequential decision-making challenges in uncertain environments, RL holds significant potential for solving complex decision-making problems across various real-world scenarios such as autonomous driving [4], robotics [5], and game-playing [6, 7].”
Smart DAG Task Scheduling with Efficient Pruning-Based MCTS Method
Liu, K., Wu, Z. S., Wu, Q., & Cheng, Y. (2019) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00058 · Cited by 8
“It has a profound impact on Artificial Intelligence (AI) for games, such as board games (AlphaGo Zero [26]), poker (Texas poker [27]), etc.”
BackgroundPoker as a Domain of Expertise
Palomäki, J., Laakasuo, M., Cowley, B. U., & Lappi, O. (2020) · Työväentutkimus Vuosikirja · Cited by 17
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization
Zhang, H., Lerer, A. K., & Brown, N. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i9.21181 · Cited by 8
Self-citationExploring reinforcement learning approaches for drafting in collectible card games
Vieira, R. E. S., Tavares, A. R., & Chaimowicz, L. (2022) · Entertainment Computing · doi:10.1016/j.entcom.2022.100526 · Cited by 8
Speedup Training Artificial Intelligence for Mahjong via Reward Variance Reduction
Li, J., Wu, S., Fu, H., Fu, Q., Zhao, E., & Xing, J. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893584 · Cited by 8
“Cepheus [9], DeepStack [10], Libratus [11], and Pluribus [12] have made breakthroughs in two-player and six-player Texas Hold’em using Counterfactual Regret Minimization (CFR) [13]–[15].”
MethodOfficial International Mahjong: A New Playground for AI Research
Lu, Y., Li, W., & Li, W. (2023) · Algorithms · doi:10.3390/a16050235 · Cited by 12
Chen, Q., Wang, X., Jiang, Z. L., Wu, Y., Li, H., Cui, L., & Sun, X. (2023) · Neural Computing and Applications · doi:10.1007/s00521-023-08647-1 · Cited by 13
“…chess master Kasparov, the AlphaGo [139], AlphaGo Zero [140] defeat of Go world champion Li Shishi and Ke Jie, to the Cepheus [18], DeepStack [104], Libratus [16] and Pluribus [19] successive conquests of the challenges in two-player limit and no-limit, multiplayer no-limit Texas Hold’em games.”
BackgroundTowards an intelligent photonic system
Zou, W., Ma, B., Xu, S., Zou, X., & Wang, X. (2020) · Science China Information Sciences · doi:10.1007/s11432-020-2863-y · Cited by 8
Marchesi, A., Trovò, F., & Gatti, N. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/vwgg3155 · Cited by 8
D'Orazio, R., Morrill, D., Wright, J. R., & Bowling, M. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/hjfz7394 · Cited by 8
A Survey of Nash Equilibrium Strategy Solving Based on CFR
Li, H., Wang, X., Jia, F., Li, Y.-F., & Chen, Q. (2020) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09475-5 · Cited by 8
RLCFR: Minimize counterfactual regret by deep reinforcement learning
Li, H., Wang, X., Jia, F., Wu, Y., Zhang, J., & Qi, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115953 · Cited by 9
Multi-Agent Reinforcement Learning for Dynamic Routing Games: A Unified Paradigm.Preprint
Shou, Z., & Di, X. S. (2020) · arXiv (Cornell University) · Cited by 8
Automatic analysis of available source code of top artificial intelligence conference papers
Lin, J., Wang, Y., Yu, Y., Zhou, Y., Chen, Y., & Shi, X. (2022) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s0218194022500358 · Cited by 7
“Today’s AI products such as IBM Watson [4], AlphaGo of DeepMind [5], and Pluribus developed jointly by CMU and Facebook [6] can even triumph over the best human players.”
BackgroundModel-Free Online Learning in Unknown Sequential Decision Making Problems and Games
Farina, G., & Sandholm, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16678 · Cited by 7
Self-citationCo-evolution of synchronization and cooperation with multi-agent Q-learning
Zhu, P., Cao, Z., Liu, C., Chen, C., & Wang, Z. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0141824 · Cited by 7
Meng, L., Ge, Z., Tian, P., An, B., & Gao, Y. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i5.25722 · Cited by 7
“IIEFGs have been widely used for modeling real-world situations, such as medical treatment (Sandholm 2015), security games (Lisỳ, Davis, and Bowling 2016), cybersecurity games (Chen et al. 2017), and recreational games (Brown and Sandholm 2018, 2019).”
MethodRecursive joint simulation in games
Kovařík, V., Oesterheld, C., & Conitzer, V. (2026) · Synthese · doi:10.1007/s11229-026-05706-7 · Cited by 8
“(We discuss the most-closely related literature in greater detail in Section 2, and discuss topics related to the possibility of simulations indistinguishable from reality in Section 7.)”
Sychrovský, D., Šustr, M., Davoodi, E., Bowling, M., Lanctot, M., & Schmid, M. S. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i14.29443 · Cited by 7
Dong, S., Li, C., Yang, S., Li, W., & Gao, Y. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125116 · Cited by 7
Learning With Generalised Card Representations for “Magic: The Gathering”
Bertram, T., Fürnkranz, J., & Müller, M. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645602 · Cited by 7
“While super-human play has been achieved in some games such as Go, chess, DOTA and poker [1], [6], [13], many others still provide numerous obstacles.”
BackgroundRosenberger, J., Kuhlemann, S., Tiefenbeck, V., Kraus, M., & Zschech, P. (2026) · Lecture notes in information systems and organisation · doi:10.1007/978-3-032-08480-4_30 · Cited by 8
Solving Common-Payoff Games with Approximate Policy Iteration
Sokota, S., Lockhart, E., Timbers, F., Davoodi, E., D'Orazio, R., BURCH, N. R., Schmid, M., Bowling, M., & Lanctot, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i11.17166 · Cited by 20
Learning the Fastest RNA Folding Path Based on Reinforcement Learning and Monte Carlo Tree Search
Mao, K., & Xiao, Y. (2021) · Molecules · doi:10.3390/molecules26154420 · Cited by 7
“Deep reinforcement learning has now shown extraordinary results in many fields, such as AlphaGo [21] and AlphaGo Zero [22] for playing Go, AlphaStar for StarCraft game [23], OpenAI Five for the multiplayer video game Dota2 [24], and Pluribus for six-player nolimit Texas Hold’em [25].”
BackgroundAuto-encoder neural network based prediction of Texas poker opponent's behavior
Wang, S., Wang, H., Gao, Q., & Hao, L. (2021) · Entertainment Computing · doi:10.1016/j.entcom.2021.100446 · Cited by 7
He, K., Wu, H., Wang, Z., & Li, H. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22837 · Cited by 7
Learning Multiagent Options for Tabular Reinforcement Learning using Factor Graphs
Chen, J., Chen, J., Lan, T., & Aggarwal, V. (2022) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2022.3195818 · Cited by 10
“R EINFORCEMENTlearning(RL)hasachievedimpressive performanceinavarietyofscenarios,suchasroboticcon-trol [1], [2] and games [3]–[5].”
AlphaZe∗∗: AlphaZero-like baselines for imperfect information games are surprisingly strong
Blüml, J., Czech, J., & Kersting, K. (2023) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2023.1014561 · Cited by 12
“In recent years, projects like AlphaStar (Vinyals et al., 2019), OpenAI Five (Berner et al., 2019), and Pluribus (Brown and Sandholm, 2019) demonstrated that games with imperfect information can be learned and played with great computational effort and in a short time up to the human level and beyond.”
BackgroundOpponent Modeling in Poker Games
Yan, X., Xia, L., Yang, J. J., & Zhao, Q. (2020) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls49620.2020.9275228 · Cited by 7
“The method of solving poker problem has been developed many years, many effective poker AI have been created[1– 3].”
MethodA Neural Model for Automatic Bidding of Contract Bridge
Zhang, X., Liu, W., & Yang, F. (2020) · IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS) · doi:10.1109/hpcc-smartcity-dss50907.2020.00134 · Cited by 7
“Afew studies investigate imperfect gaming such as Poker [4] or Stratego and consider the approximate solution or improve the current result by solving the disjoint subgames since the precise combination of independent subgames is intractable.”
BackgroundScalable Online Planning via Reinforcement Learning Fine-TuningPreprint
Fickinger, A., Hu, H., Amos, B., Russell, S., & Brown, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.15316 · Cited by 21
“Despite the incredible success of neural network function approximation in reinforcement learning environments [26, 15, 4], search algorithms have largely remained tabular, as can be seen for example in AI algorithms for go [35, 36, 37], poker [27, 7, 8, 9], and Atari [32, 33, 21].”
BackgroundMethodSelf-citationCha, H., & Kim, J. (2025) · Clinical and Experimental Emergency Medicine · doi:10.15441/ceem.25.199 · Cited by 10
“Examples of user deception, such as bluffing in poker learning [39] and forming false alliances in board gameplay [40], have already been documented.”
D2CFR: Minimize Counterfactual Regret With Deep Dueling Neural Network
Li, H., Wang, X., Guo, Z., Zhang, J., & Qi, S. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3314638 · Cited by 7
“1) Experimental Testbed: Poker is a family of games that includes hidden information, deception, and bluffing, which has been used as a domain for testing game-theoretic techniques in the field of IIGs [9], [10], [11], [12], [13].”
InfluentialXiao, H., Sun, S., & Li, D. (2024) · International Conference on Computer, Vision and Intelligent Technology (ICCVIT) · doi:10.1109/iccvit63928.2024.10872547 · Cited by 6
Human–AI collaboration for modeling heat conduction in nanostructures
Ding, W., Guo, J., An, M., Tsuda, K., & Shiomi, J. (2025) · npj Computational Materials · doi:10.1038/s41524-025-01657-8 · Cited by 8
Combining Tree Search and Action Prediction for State-of-the-Art Performance in DouDiZhu
Zhang, Y., Yan, D., Shi, B., Fu, H., Fu, Q., Su, H., Zhu, J., & Chen, N. (2021) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/470 · Cited by 6
“However, these methods require a complete expansion of the whole game tree to calculate counterfactual values, thereby heavily relying on a domain-specific abstraction [Brown and Sandholm, 2019] to reduce the game scale [Sandholm, 2015].”
MethodApplication of DQN-IRL Framework in Doudizhu’s Sparse Reward
Kong, Y., Shi, H., Wu, X., & Rui, Y. (2023) · Neural Processing Letters · doi:10.1007/s11063-023-11209-0 · Cited by 6
Zhang, W. (2023) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/808 · Cited by 8
“…during the last decade [Mnih et al. , 2015], including the superhuman-level AI in Go and various games [Silver et al. , 2016; Ye et al. , 2020; Brown and Sandholm, 2019], healthcare [Yu et al. , 2021], robotic control [Lee et al. , 2020], real-time bidding based advertising [Jin et al. ,…”
BackgroundKotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0005 · Cited by 6
Kalogiannis, F., Yan, J., & Panageas, I. (2024) · neural information processing systems · doi:10.52202/079017-2948 · Cited by 15
Heuristic Sensing: An Uncertainty Exploration Method in Imperfect Information Games
Guo, Z., Wang, X., Qi, S., Qian, T., & Zhang, J. (2020) · Complexity · doi:10.1155/2020/8815770 · Cited by 6
“Not long ago, Brown et al. proposed poker agent Pluribus to solve the problem of multiplayer poker [8].”
BackgroundRetractedMulti-Agent Reinforcement Learning in Cournot Games
Shi, Y., & Zhang, B. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304089 · Cited by 6
“These successes include playing games with super-human performance [1], solving complex robotic tasks [2], [3] and autonomous driving [4].”
BackgroundSound Algorithms in Imperfect Information Games
Šustr, M., Schmid, M., Moravčík, M., BURCH, N. R., Lanctot, M., & Bowling, M. (2021) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/yeoy6616 · Cited by 7
Mastering the Game of 3v3 Snakes with Rule-Enhanced Multi-Agent Reinforcement Learning
Wang, J., Xue, D., Zhao, J., Zhou, W., & Li, H. (2022) · IEEE Conference on Games (CoG) · doi:10.1109/cog51982.2022.9893608 · Cited by 6
“…in part by the National Natural Science Foundation of China under Contract 61836011 and in part by the Youth Innovation Promotion Association CAS under Grant 2018497. the performance of AI in Mahjong [3], multi-player Texas Hold’em [4] and Fighting game [5] have reached human professional level.”
BackgroundApplication of Artificial Intelligence in Shoulder Pathology
Cheng, C., Liang, X., Guo, D., & Xie, D. (2024) · Diagnostics · doi:10.3390/diagnostics14111091 · Cited by 9
“…to sequences of reinforcement learning, the algorithm was trained to make sequences of decisions by rewarding or punishing it based on its actions [15]. decisions by rewarding or punishing it based on its actions [15]. some certain ML models lack interpretability or transparency, Additionally,…”
Learning Expensive Coordination: An Event-Based Deep RL Approach
Shi, Z., Yu, R., Wang, X., Wang, R., Zhang, Y., Lai, H., & An, B. (2020) · Singapore Management University Institutional Knowledge (InK) (Singapore Management University) · Cited by 6
Reward function shape exploration in adversarial imitation learning: an empirical study
Wang, Y., & Li, X. (2021) · IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA) · doi:10.1109/icaica52286.2021.9497894 · Cited by 6
WagerWin: An Efficient Reinforcement Learning Framework for Gambling Games
Wang, H., Wu, H.-J., & Lai, G. (2023) · IEEE Transactions on Games · doi:10.1109/tg.2022.3226526 · Cited by 6
“Based on Libratus, Pluribus [21] further beats top professionals in six-player no-limit Texas hold’em.”
BackgroundOpenHoldem: A Benchmark for Large-Scale Imperfect-Information Game Research
Li, K., Xu, H., Zhao, E., Wu, Z., & Xing, J. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3280186 · Cited by 7
“Pluribus [25] defeated elite human professional players in six-player NLTH by extending the techniques behind Libratus.”
InfluentialAvalon: A Benchmark for RL Generalization Using Procedurally Generated Worlds
Albrecht, J., Fetterman, A. J., Fogelman, B., Kitanidis, E., Wróblewski, B., Seo, N., Rosenthal, M., Knutins, M., Polizzi, Z., Simon, J. B., et al. (2022) · neural information processing systems · doi:10.52202/068431-0931 · Cited by 27
Fast Complete Algorithm for Multiplayer Nash EquilibriumPreprint
Ganzfried, S. (2020) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.2002.04734 · Cited by 6
“Recently an agent was created for 6-player no-limit Texas hold ’em that defeated strong human players by attempting to approximate Nash equilibrium strategies [6].”
BackgroundQuantum Go MachinePreprint
Qiao, L., Gao, J., Jiao, Z., Zhang, Z.-Y., Cao, Z., Ren, R.-J., Zhang, C.-N., Hu, C.-Q., Xu, X.-Y., Tang, H. L., et al. (2020) · doi:10.21203/rs.3.rs-94303/v1 · Cited by 6
“[10] Brown, N.”
BackgroundOff-Policy Exploitability-Evaluation in Two-Player Zero-Sum Markov GamesPreprint
Abe, K., & Kaneko, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02141 · Cited by 8
Last-iterate Convergence in Extensive-Form GamesPreprint
Lee, C., Kroer, C., & Luo, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.14326 · Cited by 6
“…works have applied optimism ideas to EFGs, such as optimistic algorithms with dilated regularizers [Kroer et al., 2020, Farina et al., 2019b], CFR-like local optimistic algorithms [Farina et al., 2019a], and optimistic CFR algorithms [Burch, 2018, Brown and Sandholm, 2019a, Farina et al., 2021a].”
BackgroundMethodInfluentialExamining Artificial Intelligence Anxiety in the Context of Anthropocentrism and the Art Turing Test
Xu, R., Hsu, Y., & Wang, X. (2025) · Empirical Studies of the Arts · doi:10.1177/02762374251353671 · Cited by 5
“…have been adopted in various fi elds and application over the past decade, including chess (Gordijn & Have, 2023), Go (Curran et al., 2020), poker (Brown & Sandholm, 2019), competitive gaming (Justesen et al., 2019), composition (Hong et al., 2022; Moura & Maw, 2021), poetry, and painting (Park…”
Dynamics of Q -Learning in Networked Stochastic Games
Yuan, Z., Jiang, G., Hu, S., Perc, M., Chu, C., & Liu, J. (2026) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3641365 · Cited by 14
“…in multiagent reinforcement learning (MARL) have significantly improved the decision-making abilities of agents, driving progress in robotics [1], autonomous systems [2], resource allocation mechanisms [3], social dynamics research [4], [5], [6], [7], and intelligent game agents [8], [9], [10].”
Shared Minds: The Cognitive Parallels Between Humans and Artificial Intelligence
Tremblay, S., Marois, A., Zare, M., & Lafond, D. (2026) · Human Behavior and Emerging Technologies · doi:10.1155/hbe2/9946143 · Cited by 5
Converging to Team-Maxmin Equilibria in Zero-Sum Multiplayer Games
Zhang, Y., & An, B. (2020) · International Conference on Machine Learning · Cited by 5
Defense and security planning under resource uncertainty and multi‐period commitments
Caballero, W. N., Banks, D. L., & Wu, K. (2022) · Naval Research Logistics (NRL) · doi:10.1002/nav.22071 · Cited by 5
“This fact has been leveraged to achieve superhuman performance in complex strategic interactions, such as poker (Brown & Sandholm, 2019).”
BackgroundA Q-based policy gradient optimization approach for Doudizhu
Yu, X., Wang, Y., Qin, J., & Chen, P. (2022) · Applied Intelligence · doi:10.1007/s10489-022-04281-x · Cited by 5
“Recently, a superhuman AI for multiplayer poker was proposed [8].”
BackgroundResearch and applications of game intelligence
Hao, J., Shao, K., Li, K., Li, D., Mao, H., Hu, S., & Wang, Z. (2023) · Scientia Sinica Informationis · doi:10.1360/ssi-2023-0010 · Cited by 7
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.