Optimization of Multitype Branching Processes
From MaRDI portal
Cited in
(9)- Asymptotic expansions for dynamic programming recursions with general nonnegative matrices
- On fractional flow models and equivalent finite state processes
- Recursive stochastic games with positive rewards
- Recursive Markov decision processes and recursive stochastic games
- On the reduction of total-cost and average-cost MDPs to discounted mdps
- scientific article; zbMATH DE number 7561608 (Why is no real title available?)
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem
- Model-free reinforcement learning for branching Markov decision processes
This page was built for publication: Optimization of Multitype Branching Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4114958)