Growth Optimality for Branching Markov Decision Chains

DOI10.1287/moor.7.4.582zbMath0498.90082OpenAlexW2028099358MaRDI QIDQ3964343

Uriel G. Rothblum, Peter Whittle

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.4.582

zbMATH Keywords

algebraic growth ratebranching Markov decision chainsexistence of optimal transition matricesgeometric growth rate

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items

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 ⋮ Local Poisson equations associated with discrete-time Markov control processes ⋮ Unnamed Item ⋮ A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem ⋮ Recursive stochastic games with positive rewards ⋮ Two cores of a nonnegative matrix ⋮ Perron vector optimization applied to search engines ⋮ Unnamed Item ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Unnamed Item ⋮ Gainfree Leontief substitution flow problems ⋮ Dynamics of piecewise linear maps and sets of nonnegative matrices ⋮ Totally expanding multiplicative systems ⋮ On the reduction of total‐cost and average‐cost MDPs to discounted MDPs ⋮ Multiplicative processes reaching stationarity in finite time ⋮ Generalized eigenvectors and sets of nonnegative matrices ⋮ From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.