Abstraction pathologies in extensive games

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2009, Pages 870-877

  Waugh, Kevin ^a   Schnizlein, David ^a   Bowling, Michael ^a   Szafron, Duane ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Abstraction; Equilibrium; Game theory; Pathologies

Indexed keywords

AUTONOMOUS AGENTS; COMPUTER PROGRAMMING LANGUAGES; GAME THEORY; LEAD REFINING; MULTI AGENT SYSTEMS; PATHOLOGY; PHASE EQUILIBRIA;

ABSTRACT GAMES; ABSTRACTION; ABSTRACTION TECHNIQUES; MULTIPLE AGENTS; RECENT RESEARCHES;

ABSTRACTING;

EID: 84899862546     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

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 Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), 2003.
2. S. Ganzfried and T. Sandholm. Computing an approximate jam/fold equilibrium for 3-agent no-limit texas hold'em tournaments. In AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, 2008.
3. A. Gilpin, S. Hoda, J. Pena, and T. Sandholm. Gradient-based algorithms for finding nash equilibria in extensive form games. In Proceedings of the Eighteenth International Conference on Game Theory, 2007.
4. A. Gilpin and T. Sandholm. A competitive texas hold'em poker poker via automated abstraction and real-time equilibrium computation. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2006.
5. A. Gilpin and T. Sandholm. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of texas hold'em poker. In Proceedings of the National Conference on Artificial Intelligence (AAAI). AAAI Press, 2007.
6. A. Gilpin, T. Sandholm, and T. B. Sorensen. A heads-up no-limit texas hold'em poker player: discrctized betting models and automatically generated equilibrium-finding programs. In AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, 2008.
7. M. Johanson. Robust strategies and counter-strategies: Building a champion level computer poker player. Master's thesis, University of Alberta, 2007.
8. D. Koller and A. Pfeffer. Representations and solutions for game-theoretic problems. Artificial Intelligence, 94:167-215, 1997.
9. J. V. Neumann. Zur theorie der gescllschaftsspiele. Mathematische Annalen, 100(1):295-320, 1928.
10. M. Osborne and A. Rubenstein. A Course in Game Theory. The MIT Press, 1994.
11. F. Southey, M. Bowling, B. Larson, C. Piccione, N. Burch, D. Billings, and C. Rayner. Bayes. bluff: Opponent modelling in poker. In Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI), pages 550-558. AUAI Press, 2005.
12. B. V. Stengel. Efficient computation of behavior strategies. Games and Economic Behavior, 14:220-246, 1996.
13. M. Zinkevich, M. Bowling, and N. Burch. A new algorithm for generating equilibria in massive zero-sum games. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI), pages 788-793, 2007.
14. 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.
15. M. Zinkevich and M. Littman. The AAAI computer poker competition. Journal of the International Computer Games Association, 29, 2006. News item.