Computing robust counter-strategies

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Johanson, Michael ^a   Zinkevich, Martin ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT BEHAVIOR; ALGORITHM FOR SOLVING; BAYESIAN PARADIGM; BEST RESPONSE; MULTI AGENT; PERFORMANCE; SIMPLE++; TEXAS HOLD'EM; WORST-CASE PERFORMANCE;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002. (Pubitemid 34126111)
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 International Joint Conference on Artificial Intelligence, pages 661-668, 2003.
3. David Carmel and Shaul Markovitch. Learning models of intelligent agents. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Menlo Park, CA, 1996. AAAI Press.
4. 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.
5. A. Gilpin and T. Sandholm. A competitive texas hold'em poker player via automated abstraction and real-time equilibrium computation. In National Conference on Artificial Intelligence, 2006.
6. Michael Johanson, Martin Zinkevich, and Michael Bowling. Computing robust counter-strategies. Technical Report TR07-15, Department of Computing Science, University of Alberta, 2007.
7. Peter McCracken and Michael Bowling. Safe strategies for agent modelling in games. In AAAI Fall Symposium on Artificial Multi-agent Learning, October 2004.
8. Julia Robinson. An iterative method of solving a game. Annals of Mathematics, 54:296-301, 1951.
9. Patrick Riley and Manuela Veloso. Planning for distributed execution through use of probabilistic opponent models. In Proceedings of the Sixth International Conference on AI Planning and Scheduling, pages 77-82, April 2002.
10. T.C. Schauenberg. Opponent modelling and search in poker. Master's thesis, University of Alberta, 2006.
11. M. Zinkevich, M. Bowling, and N. Burch. A new algorithm for generating strong strategies in massive zero-sum games. In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI), 2007. To Appear.
12. M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione. Regret minimization in games with incomplete information. In Neural Information Processing Systems 21, 2008.
13. M. Zinkevich and M. Littman. The AAAI computer poker competition. Journal of the International Computer Games Association, 29, 2006. News item.