arXiv (Cornell University) · 2012 · 149 citations · 6 references
ComputingStrategyGame TheoryProbability TheoryUncertainty QuantificationBayesian GamesBayesian InferenceBayesian LearningBayesian Model BuildingBayesian ModelingBayesian StatisticsBayesian Game TheoryBayesian Model SpecificationOpponent ModelingPartial ObservabilityPartial Observability ModelsPrior Distribution Specification
Poker is a challenging problem for artificial intelligence, with non-deterministic dynamics, partial observability, and the added difficulty of unknown adversaries. Modelling all of the uncertainties in this domain is not an easy task. In this paper we present a Bayesian probabilistic model for a broad class of poker games, separating the uncertainty in the game dynamics from the uncertainty of the opponent's strategy. We then describe approaches to two key subproblems: (i) inferring a posterior over opponent strategies given a prior distribution and observations of their play, and (ii) playing an appropriate response to that distribution. We demonstrate the overall approach on a reduced version of poker using Dirichlet priors and then on the full game of Texas hold'em using a more informed prior. We demonstrate methods for playing effective responses to the opponent, based on the posterior.
6
Artificial intelligence: a modern approach
Choice Reviews Online · 1995 · 22.2K citations · Full text
Darse Billings, Aaron Davidson, Jonathan Schaeffer et al. · Artificial Intelligence · 2002 · 271 citations
Approximating game-theoretic optimal strategies for full-scale poker
Darse Billings, Neil Burch, Aaron Davidson et al. · 2003 · 214 citations
Representations and solutions for game-theoretic problems
Daphne Koller, Avi Pfeffer · Artificial Intelligence · 1997 · 184 citations