Online implicit agent modelling

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

Volumn 1, Issue , 2013, Pages 255-262

  Bard, Nolan ^a   Johanson, Michael ^a   Burch, Neil ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Agent theories; Economic paradigms::Game theory (cooperative and non cooperative); Models and Architec tures::Modeling other agents and self

Indexed keywords

MULTI AGENT SYSTEMS;

AGENT THEORY; COMPLEX DOMAINS; HIGH-DIMENSIONAL; IMPLICIT MODELLING; NON-COOPERATIVE; ONLINE LEARNING; RESPONSE STRATEGIES; VARIANCE REDUCTIONS;

AUTONOMOUS AGENTS;

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

References (16)

1. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite time analysis of the multiarmed bandit problem. Machine Learning, 47: 235-256, 2002.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proc. of the 36th Annual Symposium on Foundations of Computer Science, 1995.
3. M. Bowling, M. Johanson, N. Burch, and D. Szafron. Strategy evaluation in extensive games with importance sampling. In Proc. of the 25th Annual Int. Conf. on Machine Learning (ICML), 2008.
4. S. Ganzfried and T. Sandholm. Game theory-based opponent modeling in large imperfect-information games. In Proc. of the 10th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS), 2011.
5. S. Ganzfried and T. Sandholm. Safe opponent exploitation. In Proc. of the 13th ACM Conf. on Electronic Commerce (EC), 2012.
6. 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 Proc. of the 22nd National Conf. on Artificial Intelligence (AAAI). AAAI Press, 2007.
7. B. Hoehn, F. Southey, R. C. Holte, and V. Bulitko. Effective short-term opponent exploitation in simplified poker. In Proc. of the 20th National Conf. on Artificial Intelligence (AAAI), 2005.
8. E. Jackson. The Annual Computer Poker Competition webpage. http://www.computerpokercompetition.org/, 2012.
9. M. Johanson and M. Bowling. Data biased robust counter strategies. In Proc. of the 12th Int. Conf. on Artificial Intelligence and Statistics (AISTATS), 2009.
10. M. Johanson, M. Zinkevich, and M. Bowling. Computing robust counter-strategies. In Proc. of the Annual Conf. on Neural Information Processing Systems (NIPS), 2007.
11. A. Krause and D. Golovin. Tractability: Practical Approaches to Hard Problems, chapter Submodular Function Maximization. Cambridge University Press, 2012 (to appear).
12. P. McCracken and M. Bowling. Safe strategies for agent modelling in games. In AAAI Fall Symposium on Artificial Multi-agent Learning, October 2004.
13. J. Rubin and I. Watson. On combining decisions from multiple expert imitators for performance. In Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI), 2011.
14. J. Rubin and I. Watson. Opponent type adaptation for case-based strategies in adversarial games. In Proc. of the 20th Int. Conf. on Case-Based Reasoning (ICCBR), 2012.
15. K. Waugh, D. Schnizlein, M. Bowling, and D. Szafron. Abstraction pathologies in extensive games. In Proc. of the 8th Int. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS), 2009.
16. 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.