Convergence of Monte Carlo tree search in simultaneous move games

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Lisý, Viliam ^a   Kovařík, Vojtěch ^a   Lanctot, Marc ^b   Bošanský, Branislav ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; GAME THEORY;

EXTENSIVE-FORM GAMES; MATRIX GAME; MONTE CARLO TREE SEARCH (MCTS); MONTE-CARLO TREE SEARCHES; NASH EQUILIBRIA; PERFECT INFORMATIONS; REGRET MATCHING; SELECTION METHODS;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS; FORESTRY;

EID: 84898992540     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent Conitzer, Michal Pechoucek, and Milind Tambe. A double oracle algorithm for zero-sum security games. In Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pages 327-334, 2011.
2. Michael Johanson, Nolan Bard, Neil Burch, and Michael Bowling. Finding optimal abstract strategies in extensive-form games. In Proceedings of the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), pages 1371-1379, 2012.
3. S. M. Ross. Goofspiel - the game of pure strategy. Journal of Applied Probability, 8(3):621-625, 1971.
4. Glenn C. Rhoads and Laurent Bartholdi. Computer solution to the game of pure strategy. Games, 3(4):150-156, 2012.
5. Michael L. Littman. Markov games as a framework for multi-agent reinforcement learning. In In Proceedings of the Eleventh International Conference on Machine Learning (ICML-1994), pages 157-163. Morgan Kaufmann, 1994.
6. M. Genesereth and N. Love. General game-playing: Overview of the AAAI competition. AI Magazine, 26:62-72, 2005.
7. Michael Buro. Solving the Oshi-Zumo game. In Proceedings of Advances in Computer Games 10, pages 361-366, 2003.
8. Abdallah Saffidine, Hilmar Finnsson, and Michael Buro. Alpha-beta pruning for games with simultaneous moves. In Proceedings of the Thirty-Second Conference on Artificial Intelligence (AAAI-12), pages 556-562, 2012.
9. Branislav Bosansky, Viliam Lisy, Jiri Cermak, Roman Vitek, and Michal Pechoucek. Using double-oracle method and serialized alpha-beta search for pruning in simultaneous moves games. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI), pages 48-54, 2013.
10. H. Finnsson and Y. Björnsson. Simulation-based approach to general game-playing. In The Twenty-Third AAAI Conference on Artificial Intelligence, pages 259-264. AAAI Press, 2008.
11. Olivier Teytaud and Sébastien Flory. Upper confidence trees with short term partial information. In Applications of Eolutionary Computation (EvoApplications 2011), Part I, volume 6624 of LNCS, pages 153-162, Berlin, Heidelberg, 2011. Springer-Verlag.
12. Pierre Perick, David L. St-Pierre, Francis Maes, and Damien Ernst. Comparison of different selection strategies in monte-carlo tree search for the game of Tron. In Proceedings of the IEEE Conference on Computational Intelligence and Games (CIG), pages 242-249, 2012.
13. Hilmar Finnsson. Simulation-Based General Game Playing. PhD thesis, Reykjavik University, 2012.
14. L. Kocsis and C. Szepesvári. Bandit-based Monte Carlo planning. In 15th European Conference on Machine Learning, volume 4212 of LNCS, pages 282-293, 2006.
15. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5):1127-1150, 2000.
16. Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
17. M. Shafiei, N. R. Sturtevant, and J. Schaeffer. Comparing UCT versus CFR in simultaneous games. In Proceeding of the IJCAI Workshop on General Game-Playing (GIGA), pages 75-82, 2009.
18. Kevin Waugh. Abstraction in large extensive games. Master's thesis, University of Alberta, 2009.
19. A. Blum and Y. Mansour. Learning, regret minimization, and equilibria. In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani, editors, Algorithmic Game Theory, chapter 4. Cambridge University Press, 2007.
20. Marc Lanctot, Viliam Lisý, and Mark H.M. Winands. Monte Carlo tree search in simultaneous move games with applications to Goofspiel. In Workshop on Computer Games at IJCAI, 2013.