Stochastic convexity in dynamic programming
β Scribed by Alp E. Atakan
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 124 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0938-2259
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Markov decision processes (MDPs) have proven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, statebased specifications and computations. To alleviate the combinatorial problems associated with such methods, we propo
We consider stochastic fluid programs under the average cost criterion. These models have been introduced by the author (in press, Math. Oper. Res.) and are of the following type: suppose Z t is a continuous-time Markov chain with finite state space. As long as Z t = z, the dynamics of the system at