Strong \(n\)-discount and finite-horizon optimality for continuous-time Markov decision processes
type: Item
instance of: scholarly article
title: Strong \(n\)-discount and finite-horizon optimality for continuous-time Markov decision processes
zbMATH Open document ID: 1327.93424
author: Quanxin Zhu
author: Xianping Guo
published in: Journal of Systems Science and Complexity
publication date: 2015-11-10T00:00:00Z
Mathematics Subject Classification ID: 93E20
Mathematics Subject Classification ID: 60J05
zbMATH DE Number: 6506958
zbMATH Keywords: continuous-time Markov decision process
zbMATH Keywords: expected average reward criterion
zbMATH Keywords: finite-horizon optimality
zbMATH Keywords: Polish space
zbMATH Keywords: strong \(n\)-discount optimality
MaRDI profile type: Publication
full work available at URL: s11424-014-1277-z
OpenAlex ID: W2025607623
cites work: Q4255598
cites work: Q4223191
cites work: Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
cites work: Average optimality for continuous-time Markov decision processes in Polish spaces
cites work: Average optimality inequality for continuous-time Markov decision processes in Polish spaces
cites work: Average optimality for continuous-time Markov decision processes with a policy iteration approach
cites work: Sample-Path Optimality and Variance-Minimization of Average Cost Markov Control Processes
cites work: Markov Decision Processes with Variance Minimization: A New Condition and Approach
cites work: Bias optimality versus strong 0-discount optimality in Markov control processes with unbounded costs
cites work: Blackwell Optimality for Controlled Diffusion Processes
cites work: A note on bias optimality in controlled queueing systems
cites work: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
cites work: Bias and Overtaking Optimality for Continuous-Time Jump Markov Decision Processes in Polish Spaces
cites work: Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
cites work: Q4716338
cites work: Strong 0-discount optimal policies in a Markov decision process with a Borel state space
cites work: Another Set of Conditions for Strongn(n = −1, 0) Discount Optimality in Markov Decision Processes
cites work: Sensitive discount optimality in controlled one-dimensional diffusions
cites work: Ergodic Control, Bias, and Sensitive Discount Optimality for Markov Diffusion Processes
cites work: The Laurent series, sensitive discount and Blackwell optimality for continuous-time controlled Markov chains
cites work: Bias Optimality for Continuous-Time Controlled Markov Chains
cites work: Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces
cites work: A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
cites work: Computable exponential convergence rates for stochastically ordered Markov processes
cites work: A note on optimality conditions for continuous-time Markov decision processes with average cost criterion
cites work: The relations among potentials, perturbation analysis, and Markov decision processes
cites work: Perturbation realization, potentials, and sensitivity analysis of Markov processes
DOI: 10.1007/S11424-014-1277-Z
description: scientific article; zbMATH DE number 6506958