COMPUTING AVERAGE OPTIMAL CONSTRAINED POLICIES IN STOCHASTIC DYNAMIC PROGRAMMING
From MaRDI portal
Publication:2713008
DOI10.1017/S0269964801151089zbMath1087.90523OpenAlexW2057467090MaRDI QIDQ2713008
Publication date: 2001
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964801151089
Related Items (2)
A reinforcement learning approach to call admission and call dropping control in links with variable capacity ⋮ The vanishing discount approach to constrained continuous-time controlled Markov chains
This page was built for publication: COMPUTING AVERAGE OPTIMAL CONSTRAINED POLICIES IN STOCHASTIC DYNAMIC PROGRAMMING