MCRNR: Fast computing of restricted nash responses by means of sampling

AAAI Workshop - Technical Report

Volumn WS-10-03, Issue , 2010, Pages 43-49

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

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF ALBERTA   (Canada)

^c VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DOMAINS; EXTENSIVE-FORM GAMES; FIXED STRATEGY; GAME TREES; IMPERFECT INFORMATION; MONTE CARLO; NASH EQUILIBRIUM; NASH STRATEGY; RATE OF CONVERGENCE; REGRET MINIMIZATION; SELECTIVE SAMPLING; TEXAS HOLD'EM; TREE TRAVERSAL;

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; GAME THEORY; PLANT EXTRACTS; TELECOMMUNICATION NETWORKS; USER INTERFACES;

TREES (MATHEMATICS);

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

References (14)

1. Billings, D.; Burch, N.; Davidson, A.; Holte, R. C.; Schaeffer, J.; Schauenberg, T.; and Szafron, D. 2003. Approximating game-theoretic optimal strategies for full-scale poker. In Gottlob, G., and Walsh, T, eds., Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03), 661-668. Morgan Kaufmann.
2. Billings, D. 2006. Algorithms and Assessment in Computer Poker. Ph.D. dissertation. University of Alberta.
3. Gordon, G. J. 2005. No-regret algorithms for structured prediction problems. Technical Report CMU-CALD-05-112, Carnegie Mellon University.
4. Hart, S., and Mas-Colell, A. 2000. A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5): 1127-1150.
5. Johanson, M., and Bowling, M. 2009. Data biased robust counter strategies. In Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 264-271.
6. Johanson, M.; Zinkevich, M.; and Bowling, M. 2008. Computing robust counter-strategies. In Advances in Neural Information Processing Systems 20 (NIPS).
7. Kuhn, H. W. 1950. Simplified two-person poker. Contributions to the Theory of Games 1:97-103.
8. Lanctot, M.; Waugh, K.; Zinkevich, M.; and Bowling, M. 2009. Monte carlo sampling for regret minimization in extensive games. In Advances in Neural Information Processing Systems 22 (NIPS), 1078-1086.
9. Osborne, M. J., and Rubinstein, A. 1994. A Course in Game Theory. The MIT Press.
10. Risk, N. A., and Szafron, D. 2010. Using counterfactual regret minimization to create competitive multiplayer poker agents. In Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2010).
11. Ross, S. M. 1971. Goofspiel - the game of pure strategy. Journal of Applied Probability 8(3):621-625.
12. Southey, F.; Bowling, M.; Larson, B.; Piccione, C.; Burch, N.; Billings, D.; and Rayner, C. 2005. Bayes' bluff: Opponent modelling in poker. In Proceedings of the Twenty-First Conference on Uncertaintyin Artificial Intelligence (UAI), 550-558.
13. Waugh, K.; Zinkevich, M.; Johanson, M.; Kan, M.; Schnizlein, D.; and Bowling, M. 2009. A practical use of imperfect recall. In Proceedings of the 8th Symposium on Abstraction, Reformulation and Approximation (SARA).
14. Zinkevich, M.; Johanson, M.; Bowling, M.; and Piccione, C. 2008. Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 (NIPS).