Automatically generating abstractions for planning
Artificial Intelligence
On state-space abstraction for anytime evaluation of Bayesian networks
ACM SIGART Bulletin
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Primal-dual interior-point methods
Primal-dual interior-point methods
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
GIB: Steps Toward an Expert-Level Bridge-Playing Program
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing sequential equilibria for two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
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
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Optimal Rhode Island Hold'em poker
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Approximating game-theoretic optimal strategies for full-scale poker
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Perspectives on multiagent learning
Artificial Intelligence
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
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
Artificial Intelligence
Self-interested database managers playing the view maintenance game
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Adaptive play in Texas Hold'em Poker
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Computing ε-Optimal Strategies in Bridge and Other Games of Sequential Outcome
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Methods for empirical game-theoretic analysis
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
Annals of Mathematics and Artificial Intelligence
A sampling-based approach to computing equilibria in succinct extensive-form games
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Real-time opponent modelling in trick-taking card games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Bilateral bargaining with one-sided uncertain reserve prices
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games. To address this, we introduce the ordered game isomorphism and the related ordered game isomorphic abstraction transformation. For a multi-player sequential game of imperfect information with observable actions and an ordered signal space, we prove that any Nash equilibrium in an abstracted smaller game, obtained by one or more applications of the transformation, can be easily converted into a Nash equilibrium in the original game. We present an algorithm, GameShrink, for abstracting the game using our isomorphism exhaustively. Its complexity is Õ(n2), where n is the number of nodes in a structure we call the signal tree. It is no larger than the game tree, and on nontrivial games it is drastically smaller, so GameShrink has time and space complexity sublinear in the size of the game tree. Using GameShrink, we find an equilibrium to a poker game with 3.1 billion nodes--over four orders of magnitude more than in the largest poker game solved previously. We discuss several electronic commerce applications for GameShrink. To address even larger games, we introduce approximation methods that do not preserve equilibrium, but nevertheless yield (ex post) provably close-to-optimal strategies.