Reinforcement Learning: An Introduction

ion in reinforcement learning. Artificial Intelligence, 112 (1-2):181–211. Sutton, R. S., Singh, S. P., McAllester, D. A. (2000). Comparing policy-gradient algorithms. Unpublished manuscript. Sutton, R. S., Szepesvári, Cs., Geramifard, A., Bowling, M., (2008). Dyna-style planning with linear function approximation and prioritized sweeping. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pp. 528–536. Szepesvári, Cs. (2010). Algorithms for reinforcement learning. In Synthesis Lectures on Artificial Intelligence and Machine Learning, 4(1):1–103. Morgan and Claypool. Szita, I. (2012). Reinforcement learning in games. In M. Wiering and M. van Otterlo (Eds.), Reinforcement Learning: State-of-the-Art, pp. 539–577.  Tadepalli, P., Ok, D. (1994). H-learning: A reinforcement learning method to optimize undiscounted average reward. Technical Report 94-30-01. Oregon State University, Computer Science Department, Corvallis. Tadepalli, P., Ok, D. (1996). Scaling up average reward reinforcement learning by approximating the domain models and the value function. In Proceedings of the 13th International Conference on Machine Learning (ICML 1996),  Takahashi, Y., Schoenbaum, G., and Niv, Y. (2008). Silencing the critics: Understanding the effects of cocaine sensitization on dorsolateral and ventral striatum in the context of an actor/critic model. Frontiers in Neuroscience, 2(1):86–99. Tambe, M., Newell, A., Rosenbloom, P. S. (1990). The problem of expensive chunks and its solution by restricting expressiveness. Machine Learning, 5 (3):299–348. Tan, M. (1991). Learning a cost-sensitive internal representation for reinforcement learning. In L. A. Birnbaum and G. C. Collins (Eds.),  Taylor, G., Parr, R. (2009). Kernelized value function approximation for reinforcement learning. In Proceedings of the 26th International Conference on Machine Learning (ICML 2009), pp. 1017–1024. ACM, New York. Taylor, M. E., Stone, P. (2009). Transfer learning for reinforcement learning domains: A survey. Journal of Machine Learning Research, 10 :1633–1685. Tesauro, G. (1986). Simple neural models of classical conditioning. Biological Cybernetics, 55(2-3):187–200. Tesauro, G. (1992). Practical issues in temporal difference learning. Machine Learning, 8(3-4):257–277. Tesauro, G. (1994). TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6(2):215–219. Tesauro, G. (1995). Temporal difference learning and TD-Gammon. Communications of the ACM, 38(3):58–68. Tesauro, G. (2002). Programming backgammon using self-teaching neural nets. Artificial Intelligence, 134(12):181–199. Tesauro, G., Galperin, G. R. (1997). On-line policy improvement using Monte-Carlo search. In Advances in Neural Information Processing Systems 9 (NIPS 1996), pp. 1068–1074. MIT Press, Cambridge, MA. Tesauro, G., Gondek, D. C., Lechner, J., Fan, J., Prager, J. M. (2012). Simulation, learning, and optimization techniques in Watson’s game strategies. IBM Journal of Research and Development, 56(3-4):16–1–16–11. Tesauro, G., Gondek, D. C., Lenchner, J., Fan, J., Prager, J. M. (2013). Analysis of Watson’s strategies for playing Jeopardy! Journal of Artificial Intelligence Research,  Tham, C. K. (1994). Modular On-Line Function Approximation for Scaling up Reinforcement Learning. Ph.D. thesis, University of Cambridge. Thathachar, M. A. L., Sastry, P. S. (1985). A new approach to the design of reinforcement schemes for learning automata. . Thathachar, M., Sastry, P. S. (2002). Varieties of learning automata: an overview.  Thathachar, M., Sastry, P. S. (2011). Networks of Learning  Techniques for Online Stochastic Optimization. Springer Science & Business Media. Theocharous, G., Thomas, P. S., Ghavamzadeh, M. (2015). Personalized ad recommendation for life-time value