Optimization of Multitype Branching Processes
From MaRDI portal
Publication:4114958
DOI10.1287/mnsc.23.2.117zbMath0345.90043OpenAlexW2153399290MaRDI QIDQ4114958
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.23.2.117
Population dynamics (general) (92D25) Markov and semi-Markov decision processes (90C40) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (10)
Asymptotic expansions for dynamic programming recursions with general nonnegative matrices ⋮ Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations ⋮ Model-free reinforcement learning for branching Markov decision processes ⋮ Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes ⋮ On fractional flow models and equivalent finite state processes ⋮ A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem ⋮ Recursive stochastic games with positive rewards ⋮ Unnamed Item ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ On the reduction of total‐cost and average‐cost MDPs to discounted MDPs
This page was built for publication: Optimization of Multitype Branching Processes
