Computing approximate bayes-nash equilibria in tree-games of incomplete information
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
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
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
AIMMS - Optimization Modeling
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Stochastic search methods for nash equilibrium approximation in simulation-based games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Abstraction pathologies in extensive games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Auctions with severely bounded communication
Journal of Artificial Intelligence Research
Approximating game-theoretic optimal strategies for full-scale poker
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Computing equilibria in multiplayer stochastic games of imperfect information
IJCAI'09 Proceedings of the 21st international jont conference on Artifical 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
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Constrained automated mechanism design for infinite games of incomplete information
Autonomous Agents and Multi-Agent Systems
Proceedings of the 13th ACM Conference on Electronic Commerce
Finding a nash equilibrium by asynchronous backtracking
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
Artificial Intelligence
A parameterized family of equilibrium profiles for three-player kuhn poker
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
We present a new procedure for solving large games of imperfect information. Our approach involves---somewhat counterintuitively---solving an infinite approximation of the original game, then mapping the equilibrium to a strategy profile in the original game. Our main algorithm exploits some qualitative model of equilibrium structure as an additional input to find an equilibrium in continuous games. We prove that our approach is correct even if given a set of qualitative models (satisfying a technical property) of which only some are accurate. We compute equilibria in several classes of games for which no prior algorithms have been developed. In the course of our analysis, we also develop the first mixed-integer programming formulations for computing an epsilon-equilibrium in general multiplayer normal and extensive-form games based on the extension of our initial algorithm to the multiplayer setting, which may be of independent interest. Experiments suggest that our approach can outperform the prior state of the art, abstraction-based approaches. In addition, we demonstrate the effectiveness of our main algorithm on a subgame of limit Texas hold'em---the most studied imperfect-information game in computer science.