Evaluating state-space abstractions in extensive-form games

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

Volumn 1, Issue , 2013, Pages 271-278

  Johanson, Michael ^a   Burch, Neil ^a   Valenzano, Richard ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Economic paradigms::Game theory (cooperative and non cooperative); Learning and Adaptation::Multiagent Learning

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTER PROGRAMMING LANGUAGES; MULTI AGENT SYSTEMS;

ABSTRACTION TECHNIQUES; COMPUTING RESOURCE; EXTENSIVE-FORM GAMES; LEARNING AND ADAPTATION; NON-COOPERATIVE; OPTIMAL POLICIES; OPTIMAL STRATEGIES; STATE INFORMATION;

ABSTRACTING;

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

References (21)

1. D. Arthur and S. Vassilvitskii. k-means++: The advantages of careful seeding. In SODA, 2007.
2. D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker. In IJCAI, 2003.
3. C. Elkan. Using the triangle inequality to accelerate k-means. In ICML, 2003.
4. A. Gilpin and T. Sandholm. A competitive texas hold'em poker player via automated abstraction and real-time equilibrium computation. In AAAI, 2006.
5. A. Gilpin and T. Sandholm. Lossless abstraction of imperfect information games. Journal of the ACM, 54(5), 2007.
6. A. Gilpin and T. Sandholm. Expectation-based versus potential-aware automated abstraction in imperfect information games: An experimental comparison using poker. In AAAI, 2008.
7. 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 AAAI, 2007.
8. S. Hoda, A. Gilpin, J. Peña, and T. Sandholm. Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research, 35(2): 494-512, 2010.
9. E. Jackson. Slumbot: An implementation of counterfactual regret minimization on commodity hardware. In 2012 Computer Poker Symposium, 2012.
10. M. Johanson, N. Bard, N. Burch, and M. Bowling. Finding optimal abstract strategies in extensive-form games. In AAAI, 2012.
11. M. Johanson, N. Bard, M. Lanctot, R. Gibson, and M. Bowling. Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization. In AAMAS, 2012.
12. M. Johanson, K. Waugh, M. Bowling, and M. Zinkevich. Accelerating best response calculation in large extensive games. In IJCAI, pages 258-265, 2011.
13. M. Lanctot, R. Gibson, N. Burch, and M. Bowling. No-regret learning in extensive-form games with imperfect recall. In ICML, 2012.
14. N. A. Risk and D. Szafron. Using counterfactual regret minimization to create competitive multiplayer poker agents. In AAMAS, 2010.
15. T. Sandholm. The state of solving large incomplete-information games, and application to poker. AI Magazine, 31(4): 13-32, 2010.
16. J. Shi and M. L. Littman. Abstraction methods for game theoretic poker. In Computers and Games, 2000.
17. K. Waugh. Abstraction in large extensive games. Master's thesis, University of Alberta, 2009.
18. K. Waugh, D. Schnizlein, M. Bowling, and D. Szafron. Abstraction pathology in extensive games. In AAMAS, 2009.
19. K. Waugh, M. Zinkevich, M. Johanson, M. Kan, D. Schnizlein, and M. Bowling. A practical use of imperfect recall. In SARA, 2009.
20. Wikipedia. Earth mover's distance - Wikipedia, the free encyclopedia, 2013.
21. M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione. Regret minimization in games with incomplete information. In NIPS, 2008.