Opponent modelling and commercial games

IEEE 2005 Symposium on Computational Intelligence and Games, CIG'05

Volumn , Issue , 2005, Pages 15-25

  Van Den Herik, H J ^a   Donkers, H H L M ^a   Spronck, P H M ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

HUMAN BEING; ONLINE LEARNING; OPPONENT MODELS; TWO PERSON GAME;

ARTIFICIAL INTELLIGENCE;

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

References (41)

1. Anantharaman, T. (1997). Evaluation tuning for computer chess: Linear discriminant methods. ICCA Journal, Vol. 20, No. 4, pp. 224-242.
2. Axelrod, R.M. (1984). The Evolution of Cooperation. BASIC Books, New York.
3. Billings, D., Davidson, A., Schaeffer, J., and Szafron, S. (2000). The challenge of poker. Artificial Intelligence, Vol. 134, No. 1-2, pp. 201-240. (Pubitemid 34086584)
4. Brockington, M. and Darrah, M. (2002). How Not to implement a basic scripting language. AI Game ProgrammingWisdom (ed. S. Rabin), pp. 548-554, Charles River Media, Inc., Hingham, MA.
5. Carmel, D. and Markovitch, S. (1993). Learning models of opponent's strategies in game playing. Proceedings AAAI Fall Symposion on Games: Planning and Learning, pp. 140-147, Raleigh, NC.
6. Carmel, D. and Markovitch, S. (1998). Pruning algorithms for multi-model adversary search. Artificial Intelligence, Vol. 99, No. 2, pp. 325.355. (Pubitemid 128378375)
7. Carmel, D. and Markovitch, S. (1999). Exploration strategies for model-based learning. Autonomous Agents and Multi-Agent Systems, Vol. 2, No. 2, pp. 141-272.
8. Davison, B.D. and Hirsh, H. (1998). Predicting sequences of user actions. Predicting the Future: AI Approaches to Time-Series Problems, pp. 5- 12, AAAI Press, Madison, WI. Proceedings of AAAI-98/ICML-98 Workshop, published as Technical Report WS-98-07.
9. Domingos, P. and Pazzani, M. (1997). On the optimality of the simple bayesian classifier under zeroone loss. Machine Learning, Vol. 29, pp. 103-130. (Pubitemid 127510035)
10. Donkers, H.H.L.M., Uiterwijk, J.W.H.M., and Herik, H.J. van den (2001). Probabilistic opponentmodel search. Information Sciences, Vol. 135, No. 3.4, pp. 123.149.
11. Donkers, H.H.L.M., Uiterwijk, J.W.H.M., and Herik, H.J. van den (2003). Admissibility in opponent-model search. Information Sciences, Vol. 154, No. 3-4, pp. 119-140.
12. Egnor, D. (2000). Iocaine powder. ICGA Journal, Vol. 23, No. 1, pp. 33.35.
13. Fairclough, C., Fagan, M., MacNamee, B., and Cunningham, P. (2001). Research directions for AI in computer games. 12th Irish Conference on Artificial Intelligence & Cognitive Science (AICS 2001) (ed. D. O'Donoghue), pp. 333-344.
14. Fudenberg, D. and Levine, D.K. (1998). The Theory of Learning in Games. MIT Press, Cambridge, MA.
15. F̈urnkranz, J. (1996). Machine learning in computer chess: The next generation. ICCA Journal, Vol. 19, No. 3, pp. 147.161.
16. Fyfe, C. (2004). Independent component analysis against camouflage. Computer Games: Artificial Intelligence, Design and Education (CGAIDE 2004) (eds. Q. Mehdi, N.E. Gough, S. Natkin, and D. Al-Dabass), pp. 259.262, University of Wolverhampton, Wolverhampton, UK.
17. Graepel, T., Herbrich, R., and Gold, J. (2004). Learning to fight. Computer Games: Artificial Intelligence, Design and Education (CGAIDE 2004) (eds. Q. Mehdi, N.E. Gough, S. Natkin, and D. Al-Dabass), pp. 193-200, University of Wolverhampton, Wolverhampton, UK.
18. Iida, H., Uiterwijk, J.W.H.M., and Herik, H.J. van den (1993a). Opponent-model search. Technical Report CS 93-03, Universiteit Maastricht, Maastricht, The Netherlands.
19. Iida, H., Uiterwijk, J.W.H.M., Herik, H.J. van den, and Herschberg, I.S. (1993b). Potential applications of opponent-model search. Part 1: the domain of applicability. ICCA Journal, Vol. 16, No. 4, pp. 201.208.
20. Iida, H., Handa, K,i, and Uiterwijk, J. (1995). Tutoring strategies in game-tree search. ICCA Journal, Vol. 18, No. 4, pp. 191-204.
21. Iida, H., Kotani, I., Uiterwijk, J.W.H.M., and Herik, H.J. van den (1997). Gains and risks of om search. Advances in Computer Chess 8 (eds. H.J. van den Herik and J.W.H.M. Uiterwijk), pp. 153-165, Universiteit Maastricht, Maastricht, The Netherlands.
22. Junghanns, A. (1998). Are there practical alternatives to alpha-beta? ICCA Journal, Vol. 21, No. 1, pp. 14-32.
23. Kendall, G. (2005). Iterated prisoner's dilemma competition. http://www.prisoners-dilemma.com/.
24. Laird, J.E. and Lent, M. van (2001). Human-level's AI killer application: Interactive computer games. Artificial Intelligence Magazine, Vol. 22, No. 2, pp. 15-26.
25. Livingstone, D. and Charles, D. (2004). Intelligent interfaces for digital games. Proceedings of the AAAI-04 Workshop on Challenges in Game Artificial Intelligence (eds. D. Fu, S. Henke, and J. Orkin), pp. 6-10, AAAI Press, Menlo Park, CA. (Pubitemid 43208105)
26. Madeira, C., Corruble, V., Ramalho, G., and Ratitch, B. (2004). Bootstrapping the learning process for the semiautomated design of challenging game ai. Proceedings of the AAAI-04 Workshop on Challenges in Game Artificial Intelligence (eds. D. Fu, S. Henke, and J. Orkin), pp. 72-76, AAAI Press, Menlo Park, CA. (Pubitemid 43208118)
27. Manslow, J. (2002). Learning and adaptation. AI Game Programming Wisdom (ed. S. Rabin), pp. 557-566, Charles River Media, Inc., Hingham, MA.
28. Markovitch, S. (2003). Learning and exploiting relative weakness of opponent agents. NWO-SIKS Workshop on Opponent Models in Games, Maastricht, the Netherlands.
29. Nareyek, A. (2002). Intelligent agents for computer games. Computers and Games, Second International Conference, CG 2000 (eds. T.A. Marsland and I. Frank), Vol. 2063 of Lecture Notes inComputer Science, pp. 414-422, Springer-Verlag, Heidelberg, Germany.
30. Pazzani, M. and Billsus, D. (1997). Learning and revising user profiles: The identification of interesting web sites. Machine Learning, Vol. 27, pp. 313-331. (Pubitemid 127510033)
31. Reibman, A.L. and Ballard, B.W. (1983). Nonminimax search strategies for use against fallible opponents. AAAI'83, pp. 338-342, Morgan Kaufmann Publ., San Mateo, CA.
32. Russell, S. and Norvig, P. (2003). Artificial Intelligence: A Modern Approach. Prentice Hall, Pearson Education, Upper Saddle River, NJ, second edition edition.
33. Schaeffer, J. (2001). A gamut of games. Artificial Intelligence Magazine, Vol. 22, No. 3, pp. 29-46. (Pubitemid 32935356)
34. Scott, B. (2002). The illusion of intelligence. AI Game Programming Wisdom (ed. S. Rabin), pp. 16-20, Charles River Media, Inc., Hingham, MA.
35. Slagle, J.R. and Dixon, J.K. (1970). Experiments with the M & N tree-searching program. Communications of the ACM, Vol. 13, No. 3, pp. 147-154.
36. Spronck, P.H.M., Sprinkhuizen-Kuyper, I.G., and Postma, E.O. (2004a). Difficulty scaling of game AI. GAME-ON 2004 5th International Conference on Intelligent Games and Simulation (eds. A. El Rhalibi and D. VanWelden), pp. 33-37, EUROSIS, Ghent, Belgium.
37. Spronck, P.H.M., Sprinkhuizen-Kuyper, I.G., and Postma, E.O. (2004b). Online adaptation of game opponent AI with dynamic scripting. International Journal of Intelligent Games and Simulation, Vol. 3, No. 1, pp. 45-53.
38. Sutton, R.S. and Barto, A.G. (1998). Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
39. Tomlinson, S.L. (2003). Working at thinking about playing or a year in the life of a games AI programmer. Proceedings of the 4th International Conference on Intelligent Games and Simulation (GAME-ON 2003) (eds. Q. Mehdi, N. Gough, and S. Natkin), pp. 5-12, EUROSIS, Ghent, Belgium.
40. Tozour, P. (2002). The perils of AI scripting. AI Game Programming Wisdom (ed. S. Rabin), pp. 541-547, Charles River Media, Inc., Hingham, MA.
41. von Neumann, J. and Morgenstern, O. (1944). Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ.