1. Carlos Guestrin, Daphne Koller, Ronald Parr, and Shobha Venkataraman. Efficient Solution Algorithms for Factored MDPs. Journal of Artificial Intelligence Research (JAIR), 19:399--468, 2003.
   Keywords: Markov theory, honours reading. [bibtex-entry]



2. D. V. Pynadath and M. Tambe. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. Journal of Artificial Intelligence Research, 16:389--423, 2002.
   Keywords: computational complexity, teamwork, Markov theory, graph theory, agent communication languagess, honours reading. [abstract] [bibtex-entry]



3. C. Boutilier, R. Dearden, and M. Goldszmidt. Stochastic dynamic programming with factored representations. Artificial Intelligence, 121(1-2):49--107, 2000.
   Keywords: Markov theory, honours reading. [abstract] [bibtex-entry]



4. Craig Boutilier, Thomas Dean, and Steve Hanks. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research, 11:1--94, 1999.
   Keywords: Markov theory, honours reading. [bibtex-entry]



5. D. Poole. The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94(1-2):7--56, 1997.
   Note: Publisher: Elsevier, Netherlands.
   Keywords: Markov theory, agents, game theory, honours reading. [abstract] [bibtex-entry]



6. L. R. Rabiner and B. H. Juang. An Introduction to Hidden Markov Models. IEEE ASSP Magazine, pp 4--16, 1986.
   Keywords: Markov theory, honours reading. [bibtex-entry]



7. G. David Forney. The Viterbi Algorithm. Proceedings of The IEEE, 61(3):268--278, 1973.
   Keywords: Markov theory, honours reading. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.