Decision Generalisation from Game Logs in No Limit Texas Hold'em

Abstract

Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold'em. We address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract actions. We also detail the similarity metrics used in order to identify similar scenarios, without which no generalisation of playing decisions would be possible. We show that we were able to successfully generalise no limit betting decisions from recorded data via our agent, SartreNL, which achieved a 5th place finish out of 11 opponents at the 2012 Annual Computer Poker Competition.

Cite

Text

Rubin and Watson. "Decision Generalisation from Game Logs in No Limit Texas Hold'em." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Rubin and Watson. "Decision Generalisation from Game Logs in No Limit Texas Hold'em." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/rubin2013ijcai-decision/)

BibTeX

@inproceedings{rubin2013ijcai-decision,
  title     = {{Decision Generalisation from Game Logs in No Limit Texas Hold'em}},
  author    = {Rubin, Jonathan and Watson, Ian D.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {3062-3066},
  url       = {https://mlanthology.org/ijcai/2013/rubin2013ijcai-decision/}
}