Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
From MaRDI portal
Recommendations
- Posterior bounds on the equilibrium distribution of a finite markov chain
- Computing the discounted return in markov and semi-markov chains
- Reward algorithms for semi-Markov processes
- Reward Revision for Discounted Markov Decision Problems
- Nonstationary value-iteration and adaptive control of discounted semi- Markov processes
Cited in
(14)- An iterative aggregation-disaggregation algorithm for solving linear equations
- Reward revision and the average reward Markov decision process
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Abstraction and approximate decision-theoretic planning.
- Stochastic dynamic programming with factored representations
- Reward algorithms for semi-Markov processes
- Replacement process decomposition for discounted Markov renewal programming
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Computing the discounted return in markov and semi-markov chains
- Discrete time controllable processes with bounded drift and their application in queueing systems
- Aggregation of the policy iteration method for nearly completely decomposable Markov chains
- Modified iterative aggregation procedure for maintenance optimisation of multi-component systems with failure interaction
- Posterior bounds on the equilibrium distribution of a finite markov chain
- Markov decision processes
This page was built for publication: Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688129)
