Not to be confused with Optional stopping theorem.
"Dynkin game" redirects here. For the coupling card trick, see Dynkin's card trick.
In mathematics, the theory of optimal stopping[1][2] or early stopping[3] 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.
^Chow, Y.S.; Robbins, H.; Siegmund, D. (1971). Great Expectations: The Theory of Optimal Stopping. Boston: Houghton Mifflin.
^Ferguson, Thomas S. (2007). Optimal Stopping and Applications. UCLA.
^Hill, Theodore P. (2009). "Knowing When to Stop". American Scientist. 97 (2): 126–133. doi:10.1511/2009.77.126. ISSN 1545-2786. S2CID 124798270.
(For French translation, see cover story in the July issue of Pour la Science (2009).)
In mathematics, the theory of optimalstopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order...
threshold p, which depends on the method used. See Sequential analysis. Optimalstopping Odds algorithm Secretary problem Hitting time Stopped process Disorder...
The secretary problem demonstrates a scenario involving optimalstopping theory that is studied extensively in the fields of applied probability, statistics...
J. Wainwright; Bin Yu (2011). "Early stopping for non-parametric regression: An optimal data-dependent stopping rule". 2011 49th Annual Allerton Conference...
carefully. A dynamic optimization problem of this kind is called an optimalstopping problem because the issue at hand is when to stop waiting for a better...
In the theory of online algorithms and optimalstopping, a prophet inequality is a bound on the expected value of a decision-making process that handles...
mathematical method for computing optimal strategies for a class of problems that belong to the domain of optimalstopping problems. Their solution follows...
starting the process at x {\displaystyle x} , if the optimalstopping strategy is followed. The stopping criterion is simply that one should stop upon reaching...
another is ambiguous. Decision boundaries can be approximations of optimalstopping boundaries. The decision boundary is the set of points of that hyperplane...
value of the option to try again. Mathematically, search models are optimalstopping problems. Macroeconomists have extended search theory by studying general...
fourth secretary problem, also bears his name: Robbins' problem (of optimalstopping). Robbins was born in New Castle, Pennsylvania. As an undergraduate...
optimal. If multiple projects can evolve, the problem is called Restless bandit and the Gittins index policy is a known good heuristic but no optimal...
classification. At the same time, George Barnard led a group working on optimalstopping in Great Britain. Another early contribution to the method was made...
In photography, stopping down refers to increasing the numerical f-stop number (for example, going from f/2 to f/4), which decreases the size (diameter)...
duality theorem states that if the primal has an optimal solution, x*, then the dual also has an optimal solution, y*, and cTx*=bTy*. A linear program can...
(or optimal) date to exercise an American- or Bermudan option. It is useful for hedging purposes here; see Greeks (finance) and Optimalstopping § Option...
Bjerksund and Stensland Black's approximation Least Square Monte Carlo Optimalstopping Roll-Geske-Whaley Interest rate derivatives Black model caps and floors...
Stopping power is the ability of a weapon – typically a ranged weapon such as a firearm – to cause a target (human or animal) to be incapacitated or immobilized...
problem, also called the sultan's dowry or best choice problem, in optimalstopping theory Stable marriage problem, the problem of finding a stable matching...
value tied to looking again at any price, and the optimum search problem is related to the "optimalstopping" issue. [22] Numerous search cost models exist...
A1, . . . , AN) with A0 = 0. Then the largest stopping time to exercise the American option in an optimal way is τ max := { N if A N = 0 , min { n ∈ {...
Uncertainty in Artificial Intelligence (UAI). C. Daskalakis and Y. Kawase: "OptimalStopping Rules for Sequential Hypothesis Testing". In 25th Annual European Symposium...
Global Information