Safe strategies for agent modelling in games

AAAI Fall Symposium - Technical Report

Volumn FS-04-02, Issue , 2004, Pages 103-110

  McCracken, Peter ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; ARTIFICIAL INTELLIGENCE; GAME THEORY; RESEARCH AND DEVELOPMENT MANAGEMENT;

COMPLICATED MODELERS; EMPIRICAL EVIDENCES; MODELING ALGORITHMS; SAFE POLICY SELECTION ALGORITHM (SPS);

MULTI AGENT SYSTEMS;

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

References (15)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 1995. Gambling in a rigged casino: The adversarial multiarm bandit problem. In 36th Annual Symposium on Foun dations of Computer Science, 322-331. Milwaukee, WI: IEEE Computer Society Press.
2. Bauer, M., ed. 1995. IJCAI 95 Workshop on The Next Generation of Plan Recognition Systems: Challenges for and Insight from Related Areas of Al (Working Notes).
3. Billings, D. 2000. The first international roshambo programming competition. International Computer Games Association Journal 23(1):3-8,42-50.
4. Bowling, M., and Veloso, M. 2002. Multiagent learning using a variable learning rate. Artificial Intelligence 136(2):215-250.
5. Brown, G. W. 1949. Some notes on computation of games solutions. RAND Report P-78, The RAND Corporation, Santa Monica, California.
6. Carmel, D., and Markovitch, S. 1996. Learning models of intelligent agents. In Proceedings of the Thirteenth National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
7. Fudenberg, D., and Levine, D. K. 1999. The Theory of Learning in Games. The MIT Press.
8. Gintis, H. 2000. Game Theory Evolving. Princeton University Press.
9. Han, K., and Veloso, M. 1999. Automated robot behavior recognition applied to robotic soccer. In Proceedings of the 9th International Symposium of Robotics Research (ISSR'99), 199-204.
10. Jafari, A.; Greenwald, A.; Gondek, D.; and Ercal, G. 2001. On no-regret learning, fictitious play, and Nash equilibrium. In Proceedings of the Eighteenth International Conference on Machine Learning, 226-223.
11. Kautz, H., and Allen, J. 1986. Generalized plan recognition. In Proceedings of the 5th National Conference on Artificial Intelligence (AAA1-86), 32-37.
12. Owen, G. 1995. Game Theory. Academic Press.
13. Riley, P., and Veloso, M. 2002. Planning for distributed execution through use of probabilistic opponent models. In Proceedings of the Sixth International Conference on AI Planning and Scheduling, 77-82.
14. Robinson, J. 1951. An iterative method of solving a game. Annals of Mathematics 54:296-301.
15. von Neumann, J., and Morgenstern, O. 1944. Theory of Games and Economic Behavior. John Wiley and Sons.