Meuleau, N., Hauskrecht, M., Kim, K., Peshkin, L., Kaelbling, L., Dean, T., & Boutilier, C.

(1998). Solving very large weakly-coupled Markov decision processes. In **Proceedings**
of the 15th National Conference on Artificial Intelligence**, pp. 165–172, Madison, WI.**
Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference**. Morgan Kaufmann, San Mateo, California.** Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming**. Wiley, New York.**
Reed, B. (1992). Finding approximate separators and computing tree-width quickly. In 24th Annual Symposium on Theory of Computing**, pp. 221–228. ACM.**
Schuurmans, D., & Patrascu, R. (2001). Direct value-approximation for factored MDPs.

In Advances in Neural Information Processing Systems (NIPS-14)**, pp. 1579–1586,**
Vancouver, Canada.

Schweitzer, P., & Seidmann, A. (1985). Generalized polynomial approximations in Markovian decision processes. Journal of Mathematical Analysis and Applications, 110**, 568**
- 582.

Simon, H. A. (1981). The Sciences of the Artificial **(second edition). MIT Press, Cambridge,**
Massachusetts.

Singh, S., & Cohn, D. (1998). How to dynamically merge Markov **decision processes. In**
Jordan, M. I., Kearns, M. J., & Solla, S. A. (Eds.), **Advances in Neural Information**
Processing Systems**, Vol. 10. The MIT Press.**
St-Aubin, R., Hoey, J., & Boutilier, C. (2001). APRICODD: Approximate policy construction using decision diagrams. In **Advances in Neural Information Processing Systems**
13: Proceedings of the 2000 Conference**, pp. 1089–1095, Denver, Colorado. MIT Press.**
Stiefel, E. (1960). Note on Jordan elimination, linear programming and Tchebycheff approximation. Numerische Mathematik, 2**, 1 - 17.**
Sutton, R. S. (1988). Learning to predict by the methods of temporal differences. **Machine**
Learning, 3**, 9–44.**
Tadepalli, P., & Ok, D. (1996). Scaling up average reward reinforcmeent learning by approximating the domain models and the value function. In **Proceedings of the Thirteenth**
International Conference on Machine Learning**, Bari, Italy. Morgan Kaufmann.**
Tatman, J. A., & Shachter, R. D. (1990). Dynamic programming **and influence diagrams.**
IEEE Transactions on Systems, Man and Cybernetics, 20**(2), 365–379.**
Tsitsiklis, J. N., & Van Roy, B. (1996a). Feature-based methods for large scale dynamic programming. Machine Learning, 22**, 59–94.**
Tsitsiklis, J. N., & Van Roy, B. (1996b). An analysis of temporal-difference learning with function approximation. Technical report LIDS-P-2322, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology.

Van Roy, B. (1998). **Learning and Value Function Approximation in Complex Decision**
Processes**. Ph.D. thesis, Massachusetts Institute of Technology.**