Concept

Optimal stopping

Summary
In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming. Definition Discrete time case Stopping rule problems are associated with two objects:

A sequence of random variables X_1, X_2, \ldots, whose joint distribution is something assumed to be known

A sequence of 'reward' functions (y_i)_{i\ge 1} which depend on the observed values of the random variables in 1:

#: y_i=y_i (x_1, \ldots ,x_i) Given those objects, the
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 publications (32)

Loading

Loading

Loading

Show more
Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading