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 501–600 of 679
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point SolvingPreprint
Grand-Clément, J., & Kroer, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.13203 · Cited by 1
“Variants of CFR were used in every recent poker AI challenge, where poker AIs beat human poker players [BBJT15, MSB + 17, BS18, BS19].”
MethodDistributed Multi-Agent Learning is More Effectively than Single-AgentPreprint
Ke, S., & Liu, W. (2021) · Research Square · doi:10.21203/rs.3.rs-1070129/v1 · Cited by 1
Dong, H., & Mu, Y. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4201849 · Cited by 1
Learning state-action features for general game playing
Soemers, D. J. N. J. (2023) · Research Publications (Maastricht University) · doi:10.26481/dis.20230425ds · Cited by 4
Stability of Multi-Agent Learning: Convergence in Network Games with Many PlayersPreprint
Hussain, A., Leonte, D., Belardinelli, F., & Piliouras, G. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2307.13922 · Cited by 2
“Such examples include strong performance in competitive games (Brown & Sandholm, 2019; Perolat et al., 2022), resource allocation (Parise et al., 2020; Amelina et al., 2015) and robotics (Hamann, 2018; Hernández et al., 2013).”
BackgroundDistributed Multi-Agent Learning is More Effectively than Single-AgentPreprint
Ke, S., & Liu, W. (2023) · Research Square · doi:10.21203/rs.3.rs-1070129/v2 · Cited by 1
Fast Peer Adaptation with Context-aware ExplorationPreprint
Ma, L., Wang, Y., Zhong, F., Zhu, S. C., & Wang, Y. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2402.02468 · Cited by 1
GPU-Accelerated Counterfactual Regret MinimizationPreprint
Kim, J. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2408.14778 · Cited by 1
“…its variants dominated the development of AI agents for large imperfect information games like Poker (Tammelin et al., 2015; Morav ˇ c ´ ık et al., 2017; Brown & Sandholm, 2018; 2019b) and The Resistance: Avalon (Serrino et al., 2019) and were components of ReBeL (Brown et al., 2020) and student…”
Li, W., & Zhang, H. (2025) · Algorithms · doi:10.3390/a18060363 · Cited by 1
Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random NetworksPreprint
Leonte, D., Hussain, A., Huser, R., Belardinelli, F., & Paccagnan, D. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.10186 · Cited by 1
“…produced a number of successes in recent years, solving challenging problems in load-balancing [Krichene et al., 2014, Southwell et al., 2012], energy management [Maddouri et al., 2018] and game playing [Moravčík et al., 2017, Brown and Sandholm, 2019, Samvelyan et al., 2019, Perolat et al., 2022].”
Kapoor, A., Bhisikar, Y., Freed, B., Peters, J., & Sun, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.01554 · Cited by 1
“Multi-agent reinforcement learning (MARL) has emerged as a powerful framework for training autonomous agents to solve complex tasks (Brown & Sandholm, 2019; Vinyals et al., 2011; Kober et al., 2013; Shalev-Shwartz et al., 2016; Zhou et al., 2020).”
Deep Reinforcement Learning to Master the Asymmetric Strategy of BaghchalPreprint
Raut, R., Subedi, A., Shakya, A., & Rai, S. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5694603 · Cited by 1
Analysis of Bluffing by DQN and CFR in Leduc Hold'em PokerPreprint
Začiragić, T., Plaat, A., & Batenburg, K. J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.04125 · Cited by 1
“In 2019 Pluribus achieved superhuman performance in six-player no-limit Texas Hold’em, marking a milestone in multiplayer game AI [1,6].”
Robust Agents in Open-Ended WorldsPreprint
Samvelyan, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.08139 · Cited by 1
Learning Provably Correct Distributed Protocols Without Human KnowledgePreprint
Hui, Y., Lu, X., Perrault, A., & Wang, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.22369 · Cited by 1
“Modern ML systems that combine self-play with search have achieved superhuman performance in games with both full and partial observability (Mnih et al., 2015; Silver et al., 2017; Li et al., 2020; Bard et al., 2020; Brown & Sandholm, 2019a).”
Xia, B., Tian, W., Ren, Q., Huang, J., Xiao, J., Lu, S., Wang, K. Y., Ai, L., Yang, E., & Shi, B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.08041 · Cited by 1
“In parallel, large-scale systems achieve strong equilibrium-approximating behavior in long-horizon, imperfect-1 information games, including poker agents (DeepStack, Libratus, Pluribus) [8, 26], DeepNash for Stratego [28], and population-based training such as AlphaStar [35].”
Individual and group learning dynamics in evolutionary collective robotics
Fontbonne, N. (2023) · theses.fr (ABES) · doi:10.70675/fb9b909fz7934z4263zb2ffzdb82dbcae559 · Cited by 1
Reinforcement learning for combinatorial optimization : leveraging uncertainty, structure and priors
Grinsztajn, N. (2023) · theses.fr (ABES) · doi:10.70675/596ed207zce1az43dez9b5fzb69d2c21eb2c · Cited by 2
Amaya-Corredor, S., Calvo-Fullana, M., & Jonsson, A. (2026) · Trans. Mach. Learn. Res. · doi:10.48550/arxiv.2605.30461 · Cited by 1
“In recent years, reinforcement learning (RL) has achieved significant success in solving diverse and complex decision-making tasks (Brown & Sandholm, 2019; Orr & Dutta, 2023; Silver et al., 2017).”
Poker Arena: Multi-Axis Profiling of Strategic Reasoning and Memory in LLMsPreprint
Singla, P., Garg, S., & Singh, V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.13815 · Cited by 3
“State-of-the-art poker agents rely on counterfactual regret minimization and large-scale self-play search (Bowling et al., 2015; Brown and Sandholm, 2018, 2019), which are training-time methods inapplicable at inference; conversely, naive prompt-based agents lack persistence across hands,…”
The Virtuous Cycle of Quantum-Classical Machine LearningPreprint
Tomašev, N., McClean, J. R., & Bausch, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.10563 · Cited by 1
A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum GamesPreprint
Ha, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.22839 · Cited by 1
“Such interdependent learning dynamics underpin modern applications such as poker self-play (Brown & Sandholm, 2019), adversarial training (Goodfellow et al., 2014), and game-theoretic approaches to language-model alignment (Munos et al., 2024; Rosset et al., 2024; Wu et al., 2024; Gölz et al.,…”
Performative Reinforcement Learning
Mandal, D., Triantafyllou, S., & Radanovic, G. (2022) · arXiv · doi:10.48550/arxiv.2207.00046
“These milestones include AlphaGo (Silver et al., 2017), Pluribus (Brown & Sandholm, 2019), and AlphaS-tar (Vinyals et al., 2019).”
BackgroundA Study on Estimating the Elements of Card Game Fun Using Biological Information
Takaoka, Y., Kawakami, T., & Ooe, R. (2019) · Journal of Computer and Communications · doi:10.4236/jcc.2019.712012
A Review of Incomplete Information Game about Games
Gao, S., & Li, S. (2019) · International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI) · doi:10.1109/mlbdbi48998.2019.00015
“For example, Pluribus [21] uses an improved version of the Monte Carlo CFR (MCCFR) algorithm in the self-paly strategy, and then aggregates other algorithms, such as subgames and abstract algorithms, which defeats human players in the field of multiplayer game.”
BackgroundMethodReducing Variance in Monte Carlo Counterfactual Regret Minimization
Kuchař, P. (2020) · Czech Technical University Digital Library (Czech Technical University in Prague)
On Building Generalizable Learning Agents
Wu, Y. (2019) · UC Berkeley
Off-Policy Exploitability-Evaluation and Equilibrium-Learning in Two-Player Zero-Sum Markov GamesPreprint
Abe, K., & Kaneko, Y. (2020) · arXiv (Cornell University)
Newton-based Policy Optimization for Games.Preprint
Ramponi, G., & Restelli, M. (2020) · arXiv (Cornell University)
Computing team-maxmin equilibria in zero-sum multiplayer games
Zhang, Y. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/142946
“…in multiplayer poker games, all except one of them may form a team and play against the target player, i.e., they share the same goal but take actions independently (e.g., the setting of poker games in Brown and Sandholm (2019) avoids that players can communicate to correlate their actions).”
BackgroundMethodInfluentialHu, X., Xia, L., Yang, J. J., & Zhao, Q. (2020) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls49620.2020.9275075
“Brown et al. introduce Libratus [9] which beat four leading human professionals in HUNL and Pluribus [10] which outperformed top human professionals in six-player no-limit texas hold’em poker.”
BackgroundFast Complete Algorithm for Multiplayer Nash EquilibriumPreprint
Ganzfried, S. (2024) · Research Square · doi:10.21203/rs.3.rs-3960412/v1
Preplay Communication in Multi-Player Sequential Games: An Overview of Recent Results
Celli, A. (2021) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-030-62476-7_9
To be a fast adaptive learner: using game history to defeat opponentsPreprint
Cheng, G., & Tang, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.08110
A Highly-Parameterized Ensemble to Play Gin Rummy
Nagai, M., Shrivastava, K., Ta, K., Bogaerts, S. A., & Byers, C. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i17.17839
“In contrast, (Brown and Sandholm 2019) discusses performance optimization of a poker player through self-play against five copies of the player using a Nash equilibrium strategy and Monte-Carlo counterfactual regret minimization.”
MethodNNCFR: Minimize Counterfactual Regret with Neural Networks.Preprint
Li, H., Wang, X., Guo, Z., Zhang, J., & Qi, S. (2021) · arXiv (Cornell University)
Playing mini-Hanabi card game with Q-learning
ひい, と., 市来, 正., & 中里, 研. (2020)
Common sense skills: Artificial intelligence and the workplace
Cheke, L. G., Halina, M., & Crosby, M. (2021) · Educational research and innovation · doi:10.1787/5fe70a0c-en
Assessing Natural Language Processing
Graham, Y. (2021) · Educational research and innovation · doi:10.1787/fcd5e244-en
Deep Reinforcement Learning from Self-Play in No-limit Texas Hold'em Poker
Pricope, T.-V. (2021) · Studia Universitatis Babeș-Bolyai Informatica · doi:10.24193/subbi.2021.2.04
“Many AI bots have proven themselves to be above any human in no-limit Hold’em (Libratus [12], Pluribus [13]) but this does not mean that the game is completely solved.”
BackgroundDigitalisierung und Anti-Aging Medizin
Axmann, G. (2022) · Springer eBooks · doi:10.1007/978-3-662-61417-4_21
On the Complexity of Dark Chinese Chess
Wang, C., & Lu, T. (2022) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc55256.2022.10034182
Unspecialized Belief Learning for Zero-Shot CoordinationPreprint
Yu, H., Ni, K.-Y., Yu, W., & Huang, Y. (2022) · Research Square · doi:10.21203/rs.3.rs-1885266/v1
Cheng, Y., & Kaneko, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-11488-5_1
“For example, the Blueprint strategy is introduced in Libratus [3] and then improved in Pluribus [4].”
MethodApplications of AI in game plug-ins detection
Fang, C. (2022) · Frontiers in Computing and Intelligent Systems · doi:10.54097/fcis.v2i1.3179
LwDeepStack: A lightweight DeepStack based on knowledge distillation
Zhang, J., Guo, Z., Li, H., Wang, X., Liu, D., & Qi, S. (2022) · International Conference on Data Intelligence and Security (ICDIS) · doi:10.1109/icdis55630.2022.00072
“More and more reseachers have paid their attention on studying imperfect-information games in recent years [1]–[3].”
BackgroundFaster Optimistic Online Mirror Descent for Extensive-Form Games
Jiang, H., Liu, W., & Li, B. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20862-1_7
Wang, K., Bai, D., & Zhou, Q. (2022) · IEEE International Conference on Computer and Communications (ICCC) · doi:10.1109/iccc56324.2022.10065796
“Many breakthroughs in Texas Hold’em artificial intelligence (AI) have been achieved in recent years, with Libratus [1], DeepStack [2], Pluribus [3], and other Texas Hold’em AIs [4] beating top human players in heads-up no-limit Texas Hold’em (HUNL) and multiplayer no-limit Texas Hold’em scenarios.”
BackgroundMethodOECD (2022) · Educational research and innovation · doi:10.1787/39c4481a-fr
OECD (2022) · Educational research and innovation · doi:10.1787/cf9db84c-de
Approximating McDowell’s Evolutionary Theory of Behavior Dynamics with Stochastic Neural NetworksPreprint
Riley, S. (2023) · Thesis Commons (OSF Preprints) · doi:10.31237/osf.io/9gs5z
Regulating Artificial IntelligencePreprint
Guerreiro, J., Rebelo, S. T., & Teles, P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4652394
A hierarchical branch and bound algorithm for Mahjong deficiency
Yan, X., & Li, Y. (2023) · Soft Computing · doi:10.1007/s00500-023-09437-6
Exploring the constraints on artificial general intelligence: a game-theoretic perspectivePreprint
Ismail, M. S. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4666645
Observable Perfect Equilibrium
Ganzfried, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-50670-3_1
Exploring the Constraints on Artificial General Intelligence: A Game-Theoretic PerspectivePreprint
Ismail, M. S. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4680247
Artificial Intelligence in Neuroscience
Xiao, W., Zhang, M., & Kreiman, G. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108917339.010
Revisiting Game Representations: The Hidden Costs of Efficiency in SequentialPreprint
Kovařík, V., Milec, D., Šustr, M., Seitz, D., & Lisý, V. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4690803
OpenAI ChatGPT and the Accelerated Spread of Biased Information
Alsmadi, I. M., O’Brien, M. J., & Tuba, M. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-99-7569-3_2
The properties of mental experience evince its communicative functionPreprint
Kaifosh, P. (2024) · PsyArXiv (OSF Preprints) · doi:10.31234/osf.io/sbz8u
Fictitious Self-Play Reinforcement Learning with Expanding Value Estimation
Hu, C., Cai, Y., Li, W., & Li, H. (2023) · International Conference on Robotics, Intelligent Control and Artificial Intelligence (RICAI) · doi:10.1109/ricai60863.2023.10489294
“…such as finance (e.g., negotiation, strategic pricing, energy trading), social governance (e.g., cyber-security, traffic control), military applications (e.g., airport and network security, resource allocation), and recreational games (e.g., poker and real-time strategic games)[34][36][7][38][39].”
BackgroundWhat Are the Capabilities of Artificial Intelligence?
Paaß, G., & Hecker, D. (2023) · Springer eBooks · doi:10.1007/978-3-031-50605-5_2
Offline Hierarchical Reinforcement Learning: Enable Large-Scale Training in HRL
Wu, Y., Zhang, H., & Wang, Y.-X. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-3336-1_34
Navigating in a space of game views
Wellman, M. P., & Mayo, K. (2024) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-024-09660-x · Cited by 1
“…in structure [1–4], (2) algorithmic improvements, including new techniques for abstraction and approximation [5] and depth-limited search [6, 7], (3) modeling methodologies based on empirical methods such as agent-based simulation [8] and machine learning [9], and (4) powerful new…”
Jain, D., & Garg, A. (2024) · IEEE Conference on Artificial Intelligence (CAI) · doi:10.1109/cai59869.2024.00233 · Cited by 1
“Algorithms such as Libratus [5], Pluribus [6, 7] and ReBel [8] have outperformed humans in Poker.”
MethodHow the Government Can Mitigate the Emerging Risks of Artificial Intelligence
Joshi, A. T., Chechelnitsky, M., & Chechelnitsky, M. (2024) · Journal of Student Research · doi:10.47611/jsrhs.v13i1.6283
“[6] We do not know which frontiers of AI will evolve and how quickly.”
BackgroundBeyond Nash Equilibrium: Achieving Bayesian Perfect Equilibrium with Belief Update Fictitious Play
Ju, Q., Fang, Z., & Luo, Y. (2024) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls61622.2024.10606875
“The development of CFR+ [4], for in-2024 stance, marked a significant milestone by facilitating victo-ries over professional human players in Texas Hold’em [13– 15].”
BackgroundAi, D., Liu, T., Jiang, G., Zhang, Y., & Ma, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5591-2_14
Could the Declarer Have Discarded It? Refined Anticipation of Cards in Skat
Edelkamp, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70893-0_5
Monte-Carlo Regret Minimization for Adversarial Team Games
Carminati, L., & Cacciamani, F. (2024) · Intelligenza Artificiale · doi:10.3233/ia-240004
“Some of the most brilliant examples are games like Texas Hold’em Poker [1, 2, 18] and Starcraft II [21] for which the researchers were able to develop algorithms achieving superhuman and high-human performances, respectively.”
Fast Complete Algorithm for Multiplayer Nash Equilibrium
Ganzfried, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-74835-6_6
Wang, W. (2024) · Springer eBooks · doi:10.1007/978-981-97-5333-8_1
Artificial Intelligence Driven Metaverse: Content Generation Technology and Innovation
Tang, R. (2024) · IEEE International Conference on Information, Communication and Networks (ICICN) · doi:10.1109/icicn62625.2024.10761804
Augmenting the action space with conventions to improve multi-agent cooperation in Hanabi
Bredell, F., Engelbrecht, H. A., & Schoeman, J. C. (2025) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-025-09709-5 · Cited by 1
“Lerer et al. [14] further builds on the concept of the SAD algorithm by introducing multi-agent tree search (MATS) [39], and manage to achieve state-of-the-art performance for 2–5 player Hanabi.”
Li, C., & Matsuzaki, K. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3530476
“…researchers have developed agents that surpassed top human players in perfect information games [1], [2], in recent years, they have begun to study agents that can master more complex imperfect information games, such as no-limit Texas hold’em [3], Hanabi [4], Mahjong [5], and StarCraft II [6].”
Assessment of AI companies operational performance in India
Singh, S., & Awasthi, Y. (2025) · AIP conference proceedings · doi:10.1063/5.0245928
Modelling Behaviour in Uncertainty: A Simulation Study of Heads-Up Poker.Preprint
Chakraborty, S., Sarkar, S., & Saha, S. (2025) · Research Square · doi:10.21203/rs.3.rs-6015303/v1
Walk with Me: A Happy Relationship between Game AI and Humans
横山, 大. (2025) · Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaieti magajin/B-plus/Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaeti magajin · doi:10.1587/bplus.18.340
Learning Optimal Equilibria and Mechanisms Under Information Asymmetry
Cacciamani, F. (2025) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-031-80268-3_2
Cullen, A., & Singh, P. (2025) · Springer eBooks · doi:10.1007/978-981-97-9358-7_1
Adaptive multi-player poker policy learning based on opponent style modeling
Shi, D., Guo, X., Liu, Y., & Fan, W. (2025) · Neural Computing and Applications · doi:10.1007/s00521-025-11262-x
“Although currently there is no theoretical optimal policy for multi-player games such as multi-player poker, many studies have attempted to learn an undefeated multi-player poker policy (an approximate optimal strategy in the practical sense) [9, 10].”
A Formal Game-Theoretic Model of Blackjack: Strategic Decision-Making under Imperfect InformationPreprint
Voltes, V. E. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5223518
Monte-Carlo tree search is work in progress
Pepels, T. H. J. (2025) · Research Publications (Maastricht University) · doi:10.26481/dis.20250604tp
Zhou, X., Lin, Y., Wang, X., Jin, B., Zuo, R., & Zheng, X. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07416-2
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0005
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0007
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0007
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0001
Taxonomies of Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0004
Practical Applications of Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0010
Cognitive Architectures, AI, and Cognitive Science
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0003
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0004
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0008
Challenges of the Past and Opportunities Ahead
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0013
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0006
Cognitive Architectures in the Deep Learning Era
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0012
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0009
What Are Cognitive Architectures?
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0002
Evaluating Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0011
Li, X., Jia, Y., Yu, J., & He, F. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010249
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.