Lecture
Dynamic Programming Recap
In course
DEMO: ex pariatur sunt irure
Sint quis esse cillum labore exercitation voluptate elit irure consequat cupidatat nisi et eiusmod ullamco. Qui exercitation in nisi ut veniam labore labore est. Lorem commodo sint cupidatat adipisicing ex.
Description
This lecture covers a recap of dynamic programming, focusing on elements of modeling such as horizon, state & action space, terminal cost, and transition dynamics. The instructor explains the optimal betting strategy in a gambling problem using dynamic programming, showing that the gambler should stake 1/3 of their money each round. The correctness of the strategy is verified for different scenarios, including when the probability of winning is 1. The expected logarithm of the terminal capital is calculated under the optimal betting strategy.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.