Smoothing Techniques for Computing Nash Equilibria of Sequential Games
Mathematics of Operations Research
Computing time-dependent policies for patrolling games with mobile targets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned
Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned
Computing approximate Nash Equilibria and robust best-responses using sampling
Journal of Artificial Intelligence Research
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
We investigate iterative algorithms for computing exact Nash equilibria in two-player zero-sum extensive-form games. The algorithms use an algorithmic framework of double-oracle methods. The main idea is to restrict the game by allowing the players to play only some of the strategies, and then iteratively solve this restricted game and exploit fast best-response algorithms to add additional strategies to the restricted game for the next iteration. The experimental evaluation on different games shows that the double-oracle methods often provide significant improvement in running-time, and can find exact solution of much larger games compared to the existing approaches.