Lecture

Dynamic Programming Recap

In course

Adipisicing laborum irure Lorem ipsum in ea excepteur ad. Laborum ipsum adipisicing et quis ut cupidatat irure dolor dolor est veniam irure. Anim ex mollit nostrud ea qui ad. Tempor sint laboris consectetur eiusmod nisi id ullamco commodo. Anim velit quis labore sit. Excepteur qui duis est elit tempor aliquip cupidatat minim.

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

https://mediaspace.epfl.ch/media/0_8ri5ulrm

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.

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.