Similarity-Based retrieval and solution re-use policies in the game of texas hold'em

Authors:
Jonathan Rubin;Ian Watson
Affiliations:
Department of Computer Science, University of Auckland, New Zealand;Department of Computer Science, University of Auckland, New Zealand
Venue:
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Year:
2010

Citing 10
Cited 5

Using probabilistic knowledge and simulation to play poker

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Poker as Testbed for AI Research

AI '98 Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Categorizing Case-Base Maintenance: Dimensions and Directions

EWCBR '98 Proceedings of the 4th European Workshop on Advances in Case-Based Reasoning
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
CASPER: A Case-Based Poker-Bot

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Approximating game-theoretic optimal strategies for full-scale poker

IJCAI'03 Proceedings of the 18th international joint conference on Artificial 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
A Memory-Based Approach to Two-Player Texas Hold'em

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Game-Tree search with adaptation in stochastic imperfect-information games

CG'04 Proceedings of the 4th international conference on Computers and Games

Computer poker: A review

Artificial Intelligence
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
On combining decisions from multiple expert imitators for performance

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Case-based strategies in computer poker

AI Communications
Decision generalisation from game logs in no limit texas Hold'em

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In previous papers we have presented our autonomous poker playing agent (SARTRE) that uses a memory-based approach to create a betting strategy for two-player, limit Texas Hold'em. SARTRE participated in the 2009 IJCAI Computer Poker Competition where the system was thoroughly evaluated by challenging a range of other computerised opponents. Since the competition SARTRE has undergone case-based maintenance. In this paper we present results from the 2009 Computer Poker Competition and describe the latest modifications and improvements to the system. Specifically, we investigate two claims: the first that modifying the solution representation results in changes to the problem coverage and the second that different policies for re-using solutions leads to changes in performance. Three separate solution re-use policies for making betting decisions are introduced and evaluated. We conclude by presenting results of self-play experiments between the pre and post maintenance systems.