A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
type: Item
instance of: scholarly article
title: A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
zbMATH Open document ID: 1059.90141
author: Xianping Guo
author: Cao, Xiren
published in: Automatica
publication date: 2005-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 93B35
Mathematics Subject Classification ID: 93E20
zbMATH DE Number: 2131559
zbMATH Keywords: Policy iteration
zbMATH Keywords: Potentials
zbMATH Keywords: Perturbation analysis
zbMATH Keywords: Performance sensitivity
zbMATH Keywords: Reinforcement learning
MaRDI profile type: Publication
full work available at URL: j.automatica.2004.05.003
OpenAlex ID: W2051442802
cites work: Q4533362
cites work: Discrete Dynamic Programming
cites work: Realization probabilities. The dynamics of queuing systems
cites work: The relations among potentials, perturbation analysis, and Markov decision processes
cites work: The Maclaurin series for performance functions of Markov chains
cites work: Single sample path-based optimization of Markov chains
cites work: A unified approach to Markov decision problems and performance sensitivity analysis
cites work: From perturbation analysis to Markov decision processes and reinforcement learning
cites work: Perturbation realization, potentials, and sensitivity analysis of Markov processes
cites work: CONVERGENCE OF SIMULATION-BASED POLICY ITERATION
cites work: A Fixed Point Approach to Undiscounted Markov Renewal Programs
cites work: Limiting average criteria for nonstationary Markov decision processes
cites work: Minimax control for discrete-time time-varying stochastic systems
cites work: Q4002098
cites work: Q3266141
cites work: Q5463020
cites work: Simulation-based optimization of Markov reward processes
cites work: A note on policy algorithms for discounted Markov decision problems
cites work: Q4315289
cites work: A Brouwer fixed-point mapping approach to communicating Markov decision processes
cites work: Foolproof convergence in multichain policy iteration
cites work: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
DOI: 10.1016/J.AUTOMATICA.2004.05.003
description: scientific article; zbMATH DE number 2131559