We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the online regret (with respect to an (ε-)optimal policy) that are logarithmic in the number of steps taken. These bounds also match known asymptotic bounds for the general MDP setting. We also present corresponding lower bounds. As an application, multi-armed bandits with switching cost are considered. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ortner, R. (2008). Online regret bounds for Markov decision processes with deterministic transitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5254 LNAI, pp. 123–137). https://doi.org/10.1007/978-3-540-87987-9_14
Mendeley helps you to discover research relevant for your work.