In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...
Dynamic programming is used to solve some simple gambling models. In particular we consider the situation where an individual may bet any integral amount not greater than his fortune and he will win ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback