Basic ideas for event-based optimization of Markov systems
type: Item
instance of: scholarly article
title: Basic ideas for event-based optimization of Markov systems
zbMATH Open document ID: 1130.90054
published in: Discrete Event Dynamic Systems
publication date: 2005-04-25T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J20
Mathematics Subject Classification ID: 93C65
zbMATH DE Number: 2161213
zbMATH Keywords: perturbation analysis
zbMATH Keywords: Markov decision processes (MDPs)
zbMATH Keywords: POMDPs
zbMATH Keywords: performance potentials
zbMATH Keywords: policy iteration
zbMATH Keywords: policy gradients
zbMATH Keywords: aggregation
author: Cao, Xiren
MaRDI profile type: Publication
full work available at URL: s10626-004-6211-4
OpenAlex ID: W2062472527
cites work: Recent advances in hierarchical reinforcement learning
cites work: Q4533362
cites work: Q4533363
cites work: Q4368722
cites work: Realization probabilities. The dynamics of queuing systems
cites work: The relations among potentials, perturbation analysis, and Markov decision processes
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: The Potential Structure of Sample Paths and Performance Sensitivities of Markov Systems
cites work: Perturbation realization, potentials, and sensitivity analysis of Markov processes
cites work: A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
cites work: A single sample path-based performance sensitivity formula for Markov chains
cites work: A time aggregation approach to Markov decision processes
cites work: Stochastic optimization of regenerative systems using infinitesimal perturbation analysis
cites work: CONVERGENCE OF SIMULATION-BASED POLICY ITERATION
cites work: Potential-Based Online Policy Iteration Algorithms for Markov Decision Processes
cites work: Perturbation analysis and optimization of queueing networks
cites work: Q4002098
cites work: The no free lunch theorems: complexity and security
cites work: Simulation-based optimization of Markov reward processes
cites work: Q4315289
cites work: \({\mathcal Q}\)-learning
DOI: 10.1007/S10626-004-6211-4
description: scientific article; zbMATH DE number 2161213