Solving linear systems by methods based on a probabilistic interpretation
From MaRDI portal
Cites work
- A modified dynamic programming method for Markovian decision problems
- A set of successive approximation methods for discounted Markovian decision problems
- Action-dependent stopping times and Markov decision process with unbounded rewards
- Bounds and Transformations for Discounted Finite Markov Decision Chains
- Discounting, Ergodicity and Convergence for Markov Decision Processes
- scientific article; zbMATH DE number 3628710 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Iterative solution of the functional equations of undiscounted Markov renewal programming
- Markov programming by successive approximations with respect to weighted supremum norms
- On strong ergodicity of inhomogeneous products of finite stochastic matrices
Cited in
(2)
This page was built for publication: Solving linear systems by methods based on a probabilistic interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144900)