Integer and combinatorial optimization
Integer and combinatorial optimization
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Accelerating exact k-means algorithms with geometric reasoning
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Studies in machine cognition using the game of poker
Communications of the ACM
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Computing sequential equilibria for two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding equilibria in large sequential games of imperfect information
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Prob-Maxn: playing N-player games with opponent models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Optimal unbiased estimators for evaluating agent performance
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Effective short-term opponent exploitation in simplified poker
AAAI'05 Proceedings of the 20th 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
UAI'99 Proceedings of the Fifteenth conference on Uncertainty 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
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
Strategic betting for competitive agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
Effective short-term opponent exploitation in simplified poker
Machine Learning
Adaptive play in Texas Hold'em Poker
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Gradient-based algorithms for finding Nash equilibria in extensive form games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Artificial Intelligence
Building a no limit texas hold'em poker agent based on game logs using supervised learning
AIS'11 Proceedings of the Second international conference on Autonomous and intelligent systems
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
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
Case-based strategies in computer poker
AI Communications
AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems
Hi-index | 0.00 |
We present new approximation methods for computing game-theoretic strategies for sequential games of imperfect information. At a high level, we contribute two new ideas. First, we introduce a new state-space abstraction algorithm. In each round of the game, there is a limit to the number of strategically different situations that an equilibrium-finding algorithm can handle. Given this constraint, we use clustering to discover similar positions, and we compute the abstraction via an integer program that minimizes the expected error at each stage of the game. Second, we present a method for computing the leaf payoffs for a truncated version of the game by simulating the actions in the remaining portion of the game. This allows the equilibrium-finding algorithm to take into account the entire game tree while having to explicitly solve only a truncated version. Experiments show that each of our two new techniques improves performance dramatically in Texas Hold'em poker. The techniques lead to a drastic improvement over prior approaches for automatically generating agents, and our agent plays competitively even against the best agents overall.