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.
This lecture discusses the formulation of a gambling problem as a dynamic programming task, focusing on maximizing the expected logarithm of terminal capital. It covers planning horizon, state space, action space, and terminal cost. The lecture explains the dynamic programming solution process, including initialization and backward induction. It presents the optimal betting policy for each round and the expected terminal wealth under this policy. The lecture also explores the impact of different utility functions on the optimal betting strategy, highlighting the importance of risk preference in decision-making.