Opponent modelling by sequence prediction and lookahead in two-player games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7895 LNAI, Issue PART 2, 2013, Pages 385-396

  Mealing, Richard ^a   Shapiro, Jonathan L ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Game Theory; Lookahead; Multi Agent Learning; Opponent Modelling; Reinforcement Learning; Sequence Prediction

Indexed keywords

ACTION SELECTION; HARD PROBLEMS; LEARNING SPEED; LOOKAHEAD; MEMORY LENGTH; MULTI-AGENT LEARNING; SEQUENCE PREDICTION; TWO-PLAYER GAMES;

GAME THEORY; MULTI AGENT SYSTEMS; REINFORCEMENT LEARNING; SOFT COMPUTING;

ALGORITHMS;

EID: 84884369341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38610-7_36     Document Type: Conference Paper

References (20)

1. Watkins, C.J.C.H.: Learning from delayed rewards. PhD thesis, Cambridge (1989)
2. Brown, G.: Iterative Solutions of Games by Fictitious Play. In: Activity Analysis of Production and Allocation. Wiley, New York (1951)
3. Carmel, Markovitch: Learning models of intelligent agents. In: Proc. of 13th Int. Conf. on AI, AAAI, pp. 62-67 (1996)
4. Jensen, B., Gini, S.: Non-stationary policy learning in 2-player zero sum games. In: Proc. of 20th Int. Conf. on AI, pp. 789-794 (2005)
5. Knoll, de Freitas: A machine learning perspective on predictive coding with paq. arXiv:1108.3298 (2011)
6. Treisman, Faulkner: Generation of random sequences by human subjects: Cognitive operations or psychological process? JEP: General 116, 337-355 (1987)
7. Axelrod, R.: The evolution of strategies in the iterated prisoner's dilemma. In: Genetic Algorithms and Simulated Annealing, pp. 32-41. Morgan Kaufmann (1987)
8. Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: 11th Proc. of ICML, pp. 157-163. Morgan Kaufmann (1994)
9. Boytsov, Zaslavsky: Context Prediction in Pervasive Computing Systems. In: Burstein,F. (ed.) Supporting Real Time Decision-Making, pp. 35-63. Springer (2011)
10. Lempel, Ziv: Compression of individual sequences via variable-rate coding (1978)
11. Knoll, B.: Text prediction and classification using string matching (2009)
12. Moffat, A.: Implementing the ppm data compression scheme. IEEE Transactions on Communications 38, 1917-1921 (1990)
13. Gopalratnam, K., Cook, D.J.: Activelezi: An incremental parsing algorithm for sequential prediction. In: 16th Int. FLAIRS Conf., pp. 38-42 (2003)
14. Laird, P., Saul, R.: Discrete sequence prediction and its applications. Machine Learning 15, 43-68 (1994)
15. Millington, I.: Learning. In: Artificial Intelligence for Games, pp. 583-590. Morgan Kaufmann (2006)
16. Gers, F.A., Schraudolph, N.N., Schmidhuber, J.: Learning precise timing with lstm recurrent networks. JMLR 3, 115-143 (2002)
17. Bowling, M., Veloso, M.: Multiagent learning using a variable learning rate. Artificial Intelligence 136, 215-250 (2002)
18. Abdallah, S., Lesser, V.R.: Non-linear dynamics in multiagent reinforcement learning algorithms. In: AAMAS (3), pp. 1321-1324 (2008)
19. Zhang, Lesser: Multi-agent learning with policy prediction. In: AAAI (2010)
20. Piccolo, E., Squillero, G.: Adaptive opponent modelling for the iterated prisoner's dilemma. In: IEEE CEC, pp. 836-841 (2011)