Search

13 Mar 2012: Applications of this course are to be found in science, economics and engineering (e.g., "insects as optimizers", "planning for retirement", "finding a parking space", "optimal gambling" and "steering a space ... Bertsekas, D. P., Dynamic Programming and

16 Mar 2012: In Section 4.3 (optimal gambling) we saw that timid play is optimal in the gambling problem when the game is favorable to the gambler (p>=0.5). ... If p=0.5 all strategies are optimal. How could we prove that?

4 Sep 2012: The optimal sampling theorem also gives us a quick way to answer the first part of Example Sheet 1 #10. ... This fact is proved in the Part II course Optimization and Control (see Section 4.3 "Optimal gambling" in the Optimization and Control course notes

21 Mar 2012: 13. 4.2 Characterization of the optimal policy. 13. 4.3 Example: optimal gambling. ... Either way, we have F(π, x) F(π′, x). 13. 4.3 Example: optimal gambling.