DeepStack: expert-level artificial intelligence in heads-up no-limit poker
From MaRDI portal
(Redirected from Publication:4645965)
Abstract: Artificial intelligence has seen several breakthroughs in recent years, with games often serving as milestones. A common feature of these games is that players have perfect information. Poker is the quintessential game of imperfect information, and a longstanding challenge problem in artificial intelligence. We introduce DeepStack, an algorithm for imperfect information settings. It combines recursive reasoning to handle information asymmetry, decomposition to focus computation on the relevant decision, and a form of intuition that is automatically learned from self-play using deep learning. In a study involving 44,000 hands of poker, DeepStack defeated with statistical significance professional poker players in heads-up no-limit Texas hold'em. The approach is theoretically sound and is shown to produce more difficult to exploit strategies than prior approaches.
Recommendations
Cited in
(39)- Successful Nash equilibrium agent for a three-player imperfect-information game
- Computing human-understandable strategies: deducing fundamental rules of poker strategy
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- Limited lookahead in imperfect-information games
- Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty
- Deep reinforcement learning with emergent communication for coalitional negotiation games
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- World-class interpretable poker
- Mathematical consistency and long-term behaviour of a dynamical system with a self-organising vector field
- CECMLP: new cipher-based evaluating collaborative multi-layer perceptron scheme in federated learning
- Robust and resource-efficient identification of two hidden layer neural networks
- Committing to correlated strategies with multiple leaders
- Faster algorithms for extensive-form game solving via improved smoothing functions
- The Hanabi challenge: a new frontier for AI research
- Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games
- Generosity, selfishness and exploitation as optimal greedy strategies for resource sharing
- Rethinking formal models of partially observable multiagent decision making
- Value functions for depth-limited solving in zero-sum imperfect-information games
- DCENet: a dynamic correlation evolve network for short-term traffic prediction
- scientific article; zbMATH DE number 1784984 (Why is no real title available?)
- Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
- Computing large market equilibria using abstractions
- Distinguishing luck from skill through statistical simulation: a case study
- Evaluating strategic structures in multi-agent inverse reinforcement learning
- Superhuman AI for multiplayer poker
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- The challenge of poker
- Counterfactuals as modal conditionals, and their probability
- Solving zero-sum one-sided partially observable stochastic games
- A multivariate Riesz basis of ReLU neural networks
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
- HSVI can solve zero-sum partially observable stochastic games
- Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games
- Globally optimal strategy against the hedge algorithm in repeated games
- Regularized minimax-V learning for solving randomly terminating two-player zero-sum Markov games
- Solving optimal control problems of rigid-body dynamics with collisions using the hybrid minimum principle
- Planning in hierarchical reinforcement learning: guarantees for using local policies
- Iterative algorithms for solving one-sided partially observable stochastic shortest path games
This page was built for publication: DeepStack: expert-level artificial intelligence in heads-up no-limit poker
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645965)
