DeepStack

swMATH27097MaRDI QIDQ38815FDOQ38815

Author name not available (Why is that?)

Cited In (24)

• Limited lookahead in imperfect-information games
• Approximating maxmin strategies in imperfect recall games using A-loss recall property
• Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty
• DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
• World-class interpretable poker
• Robust and resource-efficient identification of two hidden layer neural networks
• The Hanabi challenge: a new frontier for AI research
• 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
• Committing to correlated strategies with multiple leaders
• Generosity, selfishness and exploitation as optimal greedy strategies for resource sharing
• Successful Nash equilibrium agent for a three-player imperfect-information game
• Computing human-understandable strategies: deducing fundamental rules of poker strategy
• Computing Large Market Equilibria Using Abstractions
• Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
• Faster algorithms for extensive-form game solving via improved smoothing functions
• Superhuman AI for multiplayer poker
• Value functions for depth-limited solving in zero-sum imperfect-information games
• Rethinking formal models of partially observable multiagent decision making
• DCENet: a dynamic correlation evolve network for short-term traffic prediction
• Multi-agent reinforcement learning: a selective overview of theories and algorithms
• Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games
• Deep reinforcement learning with emergent communication for coalitional negotiation games
• Distinguishing luck from skill through statistical simulation: a case study

This page was built for software: DeepStack