Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Excessive Gap Technique in Nonsmooth Convex Minimization
SIAM Journal on Optimization
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
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
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
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
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A new algorithm for generating equilibria in massive zero-sum games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Approximating game-theoretic optimal strategies for full-scale poker
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Gradient-based algorithms for finding Nash equilibria in extensive form games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
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
Abstraction pathologies in extensive games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Computing equilibria in multiplayer stochastic games of imperfect information
IJCAI'09 Proceedings of the 21st international jont conference on Artifical 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
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
Mathematics of Operations Research
Using counterfactual regret minimization to create competitive multiplayer poker agents
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Artificial Intelligence
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
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
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
Strategy purification and thresholding: effective non-equilibrium approaches for playing large games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Case-based strategies in computer poker
AI Communications
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Decision generalisation from game logs in no limit texas Hold'em
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We present Tartanian, a game theory-based player for heads-up no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinite strategy space of no-limit poker, we develop a discretized betting model designed to capture the most important strategic choices in the game. Second, we employ potential-aware automated abstraction algorithms for identifying strategically similar situations in order to decrease the size of the game tree. Third, we develop a new technique for automatically generating the source code of an equilibrium-finding algorithm from an XML-based description of a game. This automatically generated program is more efficient than what would be possible with a general-purpose equilibrium-finding program. Finally, we present results from the AAAI-07 Computer Poker Competition, in which Tartanian placed second out of ten entries.