Markov decision processes with arbitrary reward processes

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

Volumn 5323 LNAI, Issue , 2008, Pages 268-281

  Yu, Jia Yuan ^a   Mannor, Shie ^a   Shimkin, Nahum ^b  

^a MCGILL UNIVERSITY   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL PROBLEMS; DECISION MAKER (DM); MARKOV DECISION PROCESS (MDP); MARKOV DECISION PROCESSES (MDPS); PERFORMANCE LOSSES; REWARD FUNCTIONS;

REINFORCEMENT; REINFORCEMENT LEARNING;

LEARNING ALGORITHMS;

EID: 58449132310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89722-4_21     Document Type: Conference Paper

References (19)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Computing 32(1), 48-77 (2002)
2. Aumann, R.J.: Markets with a continuum of traders. Econometrica 32, 39-50 (1964)
3. Bertsekas, D.P.: Dynamic programming and optimal control, 2nd edn., vol. 2. Athena Scientific (2001)
4. Bertsekas, D.P., TsitsiMis, J.N.: Neuro-dynamic programming. Athena Scientific (1996)
5. Bobkov, S.G., Tetali, P.: Modified logarithmic Sobolev inequalities in discrete settings. Journal of Theoretical Probability 19(2), 289-336 (2006)
6. Borkar, V.S., Meyn, S.P.: The O.D.E. method for convergence of stochastic approximation and reinforcement learning. SIAM J. Control and Optimization 38(2), 447-469 (2000)
7. Brafman, R.I., Tennenholtz, M.: R-max-a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3, 213-231 (2003)
8. Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press, Cambridge (2006)
9. Crites, R.H., Barto, A.G.: An actor/critic algorithm that is equivalent to Q-learning. In: Advances in Neural Information Processing Systems, pp. 401-408 (1995)
10. Duffield, N.G., Massey, W.A., Whitt, W.: A nonstationary offered-load model for packet networks. Telecommunication Systems 16(3-4), 271-296 (2001)
11. Even-Dar, E., Kakade, S., Mansour, Y.: Experts in a Markov decision process. In: NIPS, pp. 401-408 (2004)
12. Fudenberg, D., Kreps, D.M.: Learning mixed equilibria. Games and Economic Behavior 5(3), 320-367 (1993)
13. Hannan, J.: Approximation to Bayes risk in repeated play. In: Contributions to the Theory of Games, vol. 3, pp. 97-139. Princeton University Press, Princeton (1957)
14. Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning 32(2), 151-178 (1998)
15. 15.Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. Journal of Computer and System Sciences 71(3), 291-307 (2005)
16. Mannor, S., Shimkin, N.: The empirical Bayes envelope and regret minimization in competitive Markov decision processes. Mathematics of Operations Research 28(2), 327-345 (2003)
17. Merhav, N., Ordentlich, E., Seroussi, G., Weinberger, M.J.: On sequential strategies for loss functions with memory. IEEE Trans. Inf. Theory 48(7), 1947-1958 (2002)
18. Shapley, L.: Stochastic games. PNAS 39(10), 1095-1100 (1953)
19. Yu, J.Y., Mannor, S., Shimkin, N.: Markov decision processes with arbitrarily varying rewards (Preprint, 2008), http://www.cim.mcgill.ca/~jiayuan/ mdp.pdf: