Bayes? Bluff: Opponent Modelling in Poker

Abstract

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 sub-problems: (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.

Cite

Text

Southey et al. "Bayes? Bluff: Opponent Modelling in Poker." Conference on Uncertainty in Artificial Intelligence, 2005.

Markdown

[Southey et al. "Bayes? Bluff: Opponent Modelling in Poker." Conference on Uncertainty in Artificial Intelligence, 2005.](https://mlanthology.org/uai/2005/southey2005uai-bayes/)

BibTeX

@inproceedings{southey2005uai-bayes,
  title     = {{Bayes? Bluff: Opponent Modelling in Poker}},
  author    = {Southey, Finnegan and Bowling, Michael H. and Larson, Bryce and Piccione, Carmelo and Burch, Neil and Billings, Darse and Rayner, D. Chris},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2005},
  pages     = {550-558},
  url       = {https://mlanthology.org/uai/2005/southey2005uai-bayes/}
}