Optimal Stopping Task

Context:
- It can range from being a Discrete Optimal Stopping Task to being a Continuous Optimal Stopping Task.
Example(s):
- a Secretary Problem.
- a Sequential Game.
See: Dynamic Programming, Optimization (Mathematics), Mathematical Finance, [Bellman Equation]].

References

(Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/optimal_stopping Retrieved:2017-1-30.
- In mathematics, the theory of optimal 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.