Online regret bounds for Markov decision processes with deterministic transitions
type: Item
instance of: scholarly article
title: Online regret bounds for Markov decision processes with deterministic transitions
zbMATH Open document ID: 1198.90388
author: Ronald Ortner
published in: Theoretical Computer Science
publication date: 2010-07-07T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60E15
zbMATH DE Number: 5731721
zbMATH Keywords: labeled digraph
Wikidata QID: Q29307615
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.04.005
OpenAlex ID: W2150011303
cites work: Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Optimal Adaptive Policies for Markov Decision Processes
cites work: Near-optimal regret bounds for reinforcement learning
cites work: Q4315289
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Faster parametric shortest path and minimum‐balance algorithms
cites work: Finding minimum cost to time ratio cycles with small integral transit times
cites work: Near-optimal reinforcement learning in polynomial time
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q3093197
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Asymptotically efficient adaptive allocation rules
cites work: Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
cites work: Optimal learning and experimentation in bandit problems.
cites work: Improved Rates for the Stochastic Continuum-Armed Bandit Problem
cites work: Online Markov Decision Processes
DOI: 10.1016/J.TCS.2010.04.005
description: scientific article; zbMATH DE number 5731721