A value iteration method for undiscounted multichain Markov decision processes
From MaRDI portal
(Redirected from Publication:3789375)
Recommendations
- Value iteration and approximately optimal stationary policies in finite-state average Markov decision chains
- Value Iteration in a Class of Communicating Markov Decision Chains with the Average Cost Criterion
- scientific article; zbMATH DE number 3854831
- scientific article; zbMATH DE number 970660
- Value iteration in countable state average cost Markov decision processes with unbounded costs
Cites work
- A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs
- A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs
- A value-iteration scheme for undiscounted multichain Markov renewal programs
- Computing Optimal Policies for Controlled Tandem Queueing Systems
- Dynamic programming, Markov chains, and the method of successive approximations
- Finite state Markovian decision processes
- Geometric convergence of value-iteration in multichain Markov decision problems
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3815373 (Why is no real title available?)
- scientific article; zbMATH DE number 3924501 (Why is no real title available?)
- scientific article; zbMATH DE number 3724212 (Why is no real title available?)
- scientific article; zbMATH DE number 3305566 (Why is no real title available?)
- Iterative solution of the functional equations of undiscounted Markov renewal programming
- Linear Programming and Markov Decision Chains
- Markov Renewal Programs with Small Interest Rates
- Multichain Markov Renewal Programs
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- On Finding the Maximal Gain for Markov Decision Processes
- On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process
- Optimal decision procedures for finite Markov chains. Part III: General convex systems
- Technical Note—Improved Conditions for Convergence in Undiscounted Markov Renewal Programming
- Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
- The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
- The method of value oriented successive approximations for the average reward Markov decision process
Cited in
(14)- Value iteration and approximately optimal stationary policies in finite-state average Markov decision chains
- On the existence of relative values for undiscounted multichain Markov decision processes
- A structured pattern matrix algorithm for multichain Markov decision processes
- Vector-valued Markov decision processes with average reward criterion: the multichain case
- A value-iteration scheme for undiscounted multichain Markov renewal programs
- Multiplicative Markov Decision Chains
- scientific article; zbMATH DE number 3980960 (Why is no real title available?)
- On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case
- Technical Note—Successive Approximations in Value Determination for a Markov Decision Process
- Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
- scientific article; zbMATH DE number 4092676 (Why is no real title available?)
- Value set iteration for Markov decision processes
- scientific article; zbMATH DE number 3265247 (Why is no real title available?)
- Posterior bounds on the equilibrium distribution of a finite markov chain
This page was built for publication: A value iteration method for undiscounted multichain Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789375)
