The finite-horizon Snell envelope of rewards is defined backward by and . It is the least supermartingale dominating .
Let , where is deterministic and the positive factors are independent and integrable. Use the natural filtration. Its finite-horizon Snell envelope isIndeed, backward induction and independence of random variables give ; take the maximum with immediate exercise . The constants are finite and at least one. Equivalently, is the maximum of and the successive products for . If the factors have a common mean , waiting until maturity is optimal and . Integrability and independence of random variables from the current information are essential to the finite deterministic coefficient conclusion.
Choosing a stopping time to maximize an expected reward. For an adapted integrable reward process over a finite discrete horizon, the Snell envelope computes the conditional optimal reward by comparing immediate exercise with continuation.
An optimal stopping problem in which observations update a posterior probability distribution over an unknown parameter. The decision state includes that posterior.
With independent uniform distributions on as sequential offers and a finite number of rounds, the continuation value with offers remaining is . Accept the current offer when it reaches that threshold. Integrating the maximum of the offer and continuation value gives the recursion, by the Snell envelope principle.
At a regular exercise boundary for a diffusion optimal stopping problem, value matching is commonly accompanied by matching first derivatives. This makes the value across the boundary and eliminates a derivative-jump local time of a semimartingale term in the generalized Itô formula. It does not assert that second derivatives agree, or that smooth fit holds for every possible stopping problem.
For a Markov process with reward , the value starting at time in state is the supremum of expected rewards over admissible stopping times. In finite discrete time it obeys and for the transition operator , wherever expectations are well-defined. Statewise absolute integrability of every remaining-horizon reward makes these values finite.
The transition operator of an additive random walk preserves convex functions: apply their convexity inequality to and , then integrate. The pointwise maximum of convex functions preserves convexity too, so induction proves convexity of the Snell envelope Bellman functions. Expectations are allowed to be extended-valued until finiteness is justified. Integrability of rewards on a finite horizon implies finiteness of these functions at every state for , by integrability of translated convex random-walk rewards and the bound . At time zero only is observed; if is infinite elsewhere, its finite value at zero has a constant convex extension representing the same Snell envelope. Full statewise Bellman recursion at time zero requires an additional translated-integrability hypothesis.
Let be the sum of independent identically distributed real increments. For a finite convex function , integrability of and implies integrability of for every fixed . Its negative part is controlled by negative part of a finite convex function is Lipschitz. For , if the increment law is unbounded above, take an independent increment with . On this event convexity gives , so the expectation is bounded by . If increments are bounded above by , use and bound the positive part by . For , use the symmetric lower-tail argument. This supplies translated integrability without assuming integrable increments or a growth bound on .
An optimal stopping time attains the supremum of the expected reward over an admissible class of stopping times. For a finite-horizon Snell envelope, the first time at which its value equals the current reward is optimal.
The first time the Snell-envelope compensator is about to become positive is an optimal stopping time; before it the martingale part equals both value and reward at stopping.
Articles by others on the same topic
The Snell envelope is a concept used primarily in the fields of stochastic control and optimal stopping theory. It provides a way to characterize the value of optimal stopping problems, particularly in scenarios where a decision-maker can stop a stochastic process at various times to maximize their expected payoff. Mathematically, the Snell envelope is defined as the least upper bound of the expected values of stopping times given a stochastic process. Formally, if \( X_t \) is a stochastic process (e.g.