Lecture

Optimal Betting Strategy

Description

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.

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.