Strategy purification and thresholding: Effective non-equilibrium approaches for playing large games

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

Volumn 2, Issue , 2012, Pages 608-615

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a   Waugh, Kevin ^a  

^a Computer Science Department Carnegie Mellon University ^*  (United States)

Author keywords

Abstraction; Game playing; Game theory; Large games; Non equilibrium approaches; Purification; Reverse mapping

Indexed keywords

ABSTRACTING; AUTONOMOUS AGENTS; GAME THEORY; MULTI AGENT SYSTEMS; PURIFICATION;

ABSTRACTION; GAME PLAYING; LARGE GAMES; NON EQUILIBRIUM; REVERSE MAPPING;

COMPUTER GAMES;

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

References (13)

1. 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.
2. A. Gilpin and T. Sandholm. A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation. In AAAI, 2006.
3. A. Gilpin and T. Sandholm. Lossless abstraction of imperfect information games. Journal of the ACM, 54(5), 2007.
4. A. Gilpin and T. Sandholm. Expectation-based versus potential-aware automated abstraction in imperfect information games: An experimental comparison using poker. In AAAI, 2008. Short paper.
5. A. Gilpin, T. Sandholm, and T. B. Sørensen. A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs. In AAMAS, 2008.
6. 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), 2010.
7. M. Johanson, K. Waugh, M. Bowling, and M. Zinkevich. Accelerating best response calculation in large extensive games. In IJCAI, 2011.
8. D. Koller, N. Megiddo, and B. von Stengel. Fast algorithms for finding randomized strategies in game trees. In STOC, 1994.
9. R. Porter, E. Nudelman, and Y. Shoham. Simple search methods for finding a Nash equilibrium. Games and Economic Behavior, 63(2), 2008.
10. D. Schnizlein, M. Bowling, and D. Szafron. Probabilistic state translation in extensive games with large action sets. In IJCAI, 2009.
11. J. Shi and M. Littman. Abstraction methods for game theoretic poker. In CG '00: Revised Papers from the International Conference on Computers and Games. Springer-Verlag, 2002.
12. K. Waugh, D. Schnizlein, M. Bowling, and D. Szafron. Abstraction pathologies in extensive games. In AAMAS, 2009.
13. M. Zinkevich, M. Bowling, M. Johanson, and C. Piccione. Regret minimization in games with incomplete information. In NIPS, 2007.