Computing approximate nash equilibria and robust best-responses using sampling

Journal of Artificial Intelligence Research

Volumn 42, Issue , 2011, Pages 575-605

  Ponsen, Marc ^a   De Jong, Steven ^a   Lanctot, Marc ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BEST RESPONSE; GAME TREES; IMPERFECT INFORMATION; MONTE CARLO; MONTE-CARLO SAMPLING; NASH EQUILIBRIA; NASH STRATEGY; REGRET MINIMIZATION; SEARCH TECHNIQUE; STATE-OF-THE-ART ALGORITHMS; STOCHASTIC GAME; TREE SEARCH;

ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

TELECOMMUNICATION NETWORKS;

ALGORITHMS; FORESTRY; MATHEMATICS; NETWORKS; TELECOMMUNICATIONS; TREES;

EID: 84856471584     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3402     Document Type: Article

References (35)

1. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multi-armed bandit problem. Machine Learning, 47(2-3), 235-256. (Pubitemid 34126111)
2. Balla, R. K., & Fern, A. (2009). UCT for tactical assault planning in real-time strategy games. In International Joint Conference on Artificial Intelligence (IJCAI-2009).
3. Billings, D. (2006). Algorithms and Assessment in Computer Poker. Ph.D. dissertation. University of Alberta.
4. Billings, D., Burch, N., Davidson, A., Holte, R. C., Schaeffer, J., Schauenberg, T., & Szafron, D. (2003). Approximating game-theoretic optimal strategies for full-scale poker. In Gottlob, G., & Walsh, T. (Eds.), Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 661-668. Morgan Kaufmann.
5. Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Springer.
6. Bouzy, B., & Chaslot, G. (2006). Monte-carlo go reinforcement learning experiments. In IEEE 2006Symposium on Computational Intelligence in Games, Reno, USA, pp. 187-194.
7. Chaslot, G. M. J.-B., Saito, J.-T., Bouzy, B., Uiterwijk, J., & van den Herik, H. (2006). Monte-carlo strategies for computer go. In Schobbens, P.-Y., Vanhoof, W., & Schwanen, G. (Eds.), Proceedings of the 18th Be Ne Lux Conference on Artificial Intelligence, pp. 83-90.
8. Chaslot, G. M. J.-B., Winands, M., Uiterwijk, J., van den Herik, H., & Bouzy, B. (2008). Progressive strategies for monte-carlo tree search. New Mathematics and Natural Computation, 4(3), 343-357.
9. Coulom, R. (2006). Efficient selectivity and backup operators in monte-carlo tree search. In van den Herik, H., Ciancarini, P., & Donkers, H. (Eds.), Proceedings of the 5th International Confer-ence on Computer and Games, Vol. 4630 of Lecture Notes in Computer Science (LNCS), pp. 72-83. Springer-Verlag, Heidelberg, Germany.
10. Davidson, A., Billings, D., Schaeffer, J., & Szafron, D. (2000). Improved opponent modeling in poker. In Proceedings of The 2000 International Conference on Artificial Intelligence (ICAI'2000), pp. 1467-1473.
11. Fudenberg, D., & Tirole, J. (1991). Game Theory. MIT Press, Cambridge, MA.
12. Gordon, G. J. (2005). No-regret algorithms for structured prediction problems. Tech. rep. CMU-CALD-05-112, Carnegie Mellon University.
13. Hart, S., & Mas-Colell, A. (2000). A simple adaptive procedure leading to correlated equilibrium. Econometrica,68(5), 1127-1150.
14. Hoda, S., Gilpin, A., Peña, J., & Sandholm, T. (2010). Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research, 35(2), 494-512.
15. Hoehn, B., Southey, F., & Holte, R. C. (2005). Effective short-term opponent exploitation in sim-plified poker. In In Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 783-788. AAAI Press. (Pubitemid 43006704)
16. Isaacs, R. (1965). Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Controland Optimization. John Wiley&Sons. Research Problem 12.4.1.
17. Johanson, M., & Bowling, M. (2009). Data biased robust counter strategies. In Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 264-271.
18. Johanson, M., Zinkevich, M., & Bowling, M. (2008). Computing robust counter-strategies. In Advances in Neural Information Processing Systems 20 NIPS.
19. Kocsis, L., & Szepesvári, C. (2006). Bandit Based Monte-Carlo Planning. In Fürnkranz, J., Scheffer, T., & Spiliopoulou, M. (Eds.), Machine Learning: ECML 2006, Vol. 4212 of Lecture Notes in Artificial Intelligence, pp. 282-293. (Pubitemid 44618839)
20. Kuhn, H. W. (1950). Simplified two-person poker. Contributions to the Theory of Games, 1,97-103.
21. Lanctot, M., Waugh, K., Zinkevich, M., & Bowling, M. (2009). Monte carlo sampling for regret minimization in extensive games. In Advances in Neural Information Processing Systems 22 (NIPS), pp. 1078-1086.
22. Lee, C.-S., Wang, M.-H., Chaslot, G.-B., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., & Hong, T.-P. (2010). The computational intelligence of mogo revealed in taiwan's computer go tournaments. IEEE Transactions on Computational Intelligence and AI in games, 1,73-89.
23. Nash, J. (1951). Non-cooperative games. The Annals of Mathematics, 54(2), 286-295.
24. Osborne, M. J., & Rubinstein, A. (1994). A Course in Game Theory. The MIT Press.
25. Risk, N. A., & Szafron, D. (2010). Using counterfactual regret minimization to create competitive multiplayer poker agents. In Proc. of9th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010), pp. 159-166.
26. Ross, S. M. (1971). Goofspiel \- the game of pure strategy. Journal of Applied Probability, 8(3), 621-625.
27. Sandholm, T. (2010). The state of solving large incomplete-information games, and application to poker. AIMagazine, 31(4), 13-32.
28. Schaeffer, J. (2001). A gamut of games. AIMagazine, 22, 29-46. (Pubitemid 32935356)
29. Shafiei, M., Sturtevant, N., & Schaeffer, J. (2009). Comparing UCT versus CFR in simultaneous games. In GIGA Workshop on General Game Playing IJCAI.
30. Sklansky, D. (2005). The Theory of Poker (Fourth ed. edition). Las Vegas: Two plus two.
31. Southey, F., Bowling, M., Larson, B., Piccione, C., Burch, N., Billings, D., & Rayner, D. C. (2005). Bayes' bluff: Opponent modelling in poker. In Proceedings of the 21st Conference in Uncer-tainty In Artificial Intelligence (UAI '05), pp. 550-558.
32. Sturtevant, N. R. (2008). An analysis of uct in multi-player games. In In Computers and Games.
33. von Neumann, J., & Morgenstern, O. (1944). Theory of Games and Economic Behavior. Princeton University Press.
34. Waugh, K., Zinkevich, M., Johanson, M., Kan, M., Schnizlein, D., & Bowling, M. (2009). A prac-tical use of imperfect recall. In Proceedings of the 8th Symposium on Abstraction, Reformu-lation and Approximation (SARA).
35. Zinkevich, M., Johanson, M., Bowling, M., & Piccione, C. (2008). Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 NIPS.