Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization

11th International Conference on Autonomous Agents and Multiagent Systems 2012, AAMAS 2012: Innovative Applications Track

Volumn 1, Issue , 2012, Pages 416-423

  Johanson, Michael ^a   Bard, Nolan ^a   Lanctot, Marc ^a   Gibson, Richard ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Economic paradigms:: Game theory (cooperative and non cooperative)

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; GAME THEORY; MULTI AGENT SYSTEMS;

IMPERFECT INFORMATION; NASH EQUILIBRIA; NASH EQUILIBRIUM STRATEGIES; NON-COOPERATIVE; REGRET MINIMIZATION; SAMPLING TECHNIQUE; SPEED IMPROVEMENT; TERMINAL NODES;

ITERATIVE METHODS;

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

References (10)

1. A. Gilpin, T. Sandholm, and T. B. Sørensen. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of texas hold'em poker. In Proceedings of the Twenty-Second National Conference on Artificial Intelligence (AAAI). AAAI Press, 2007.
2. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5): 1127-1150, 2000.
3. S. Hoda, A. Gilpin, J. Pena, and T. Sandholm. Smoothing techniques for computing nash equilibria of sequential games. Mathematics of Operations Research, 35(2):494-512, 2010.
4. M. Johanson, K. Waugh, M. Bowling, and M. Zinkevich. Accelerating best response calculation in large extensive games. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI), 2011.
5. D. Koller, N. Megiddo, and B. von Stengel. Fast algorithms for finding randomized strategies in game trees. In Annual ACM Symposium on Theory of Computing, STOC'94, pages 750-759, 1994.
6. M. Lanctot, K. Waugh, M. Zinkevich, and M. Bowling. Monte Carlo sampling for regret minimization in extensive games. In Advances in Neural Information Processing Systems 22 (NIPS), 2009.
7. M. Lanctot, K. Waugh, M. Zinkevich, and M. Bowling. Monte Carlo sampling for regret minimization in extensive games. Technical Report TR09-15, University of Alberta, 2009.
8. M. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.
9. M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione. Regret minimization in games with incomplete information. Technical Report TR07-14, Department of Computing Science, University of Alberta, 2007.
10. M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione. Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 (NIPS), 2008.