Monte Carlo sampling for regret minimization in extensive games

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1078-1086

  Lanctot, Marc ^a   Waugh, Kevin ^b   Zinkevich, Martin ^c   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Carnegie Mellon University   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; DECISION MAKING; MONTE CARLO METHODS; MULTI AGENT SYSTEMS;

COUNTERFACTUALS; DOMAIN SPECIFIC; IMPERFECT INFORMATION; IMPERFECT INFORMATION GAMES; MONTE CARLO SAMPLING; MULTIPLE AGENTS; NASH EQUILIBRIA; REGRET MINIMIZATION; SEQUENTIAL DECISION MAKING; ZERO SUMS;

ITERATIVE METHODS;

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

References (14)

1. Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione. Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 (NIPS), 2008.
2. Andrew Gilpin, Samid Hoda, Javier Peña, and Tuomas Sandholm. Gradient-based algorithms for finding Nash equilibria in extensive form games. In 3rd International Workshop on Internet and Network Economics (WINE'07), 2007.
3. D. Koller, N. Megiddo, and B. von Stengel. Fast algorithms for finding randomized strategies in game trees. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC '94), pages 750-759, 1994.
4. Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione. Regret minimization in game with incomplete information. Technical Report TR07-14, University of Alberta, 2007. http://www.cs.ualberta.ca/research/ techreports/2007/TR07-14.php.
5. Geoffrey J. Gordon. No-regret algorithms for online convex programs. In In Neural Information Processing Systems 19, 2007.
6. Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994.
7. Sergiu Hart and Andreu Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5):1127-1150, September 2000.
8. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics, 6:1-8, 1956.
9. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. Gambling in a rigged casino: The adversarial multi-arm bandit problem. In 36th Annual Symposium on Foundations of Computer Science, pages 322-331, 1995.
10. Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling. Monte carlo sampling for regret minimization in extensive games. Technical Report TR09-15, University of Alberta, 2009. http://www.cs.ualberta.ca/research/ techreports/2009/TR09-15.php.
11. S. M. Ross. Goofspiel - the game of pure strategy. Journal of Applied Probability, 8(3):621-625, 1971.
12. Geoffrey J. Gordon. No-regret algorithms for structured prediction problems. Technical Report CMU-CALD-05-112, Carnegie Mellon University, 2005.
13. H. W. Kuhn. Simplified two-person poker. Contributions to the Theory of Games, 1:97-103, 1950.
14. Rufus Isaacs. Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization. John Wiley & Sons, 1965.