Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A demonstration of the Polaris poker system
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Approximating game-theoretic optimal strategies for full-scale poker
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Probabilistic state translation in extensive games with large action sets
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Monte-Carlo Tree Search in Poker Using Expected Reward Distributions
ACML '09 Proceedings of the 1st Asian Conference on Machine Learning: Advances in Machine Learning
Artificial Intelligence
Similarity-Based retrieval and solution re-use policies in the game of texas hold'em
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Successful performance via decision generalisation in no limit texas hold'em
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Hi-index | 0.00 |
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.