scholarly journals Corrected random walk approximations to free boundary problems in optimal stopping

2007 ◽  
Vol 39 (3) ◽  
pp. 753-775 ◽  
Author(s):  
Tze Leung Lai ◽  
Yi-Ching Yao ◽  
Farid Aitsahlia

Corrected random walk approximations to continuous-time optimal stopping boundaries for Brownian motion, first introduced by Chernoff and Petkau, have provided powerful computational tools in option pricing and sequential analysis. This paper develops the theory of these second-order approximations and describes some new applications.

2007 ◽  
Vol 39 (03) ◽  
pp. 753-775
Author(s):  
Tze Leung Lai ◽  
Yi-Ching Yao ◽  
Farid Aitsahlia

Corrected random walk approximations to continuous-time optimal stopping boundaries for Brownian motion, first introduced by Chernoff and Petkau, have provided powerful computational tools in option pricing and sequential analysis. This paper develops the theory of these second-order approximations and describes some new applications.


1989 ◽  
Vol 26 (04) ◽  
pp. 695-706
Author(s):  
Gerold Alsmeyer ◽  
Albrecht Irle

Consider a population of distinct species Sj , j∈J, members of which are selected at different time points T 1 , T 2,· ··, one at each time. Assume linear costs per unit of time and that a reward is earned at each discovery epoch of a new species. We treat the problem of finding a selection rule which maximizes the expected payoff. As the times between successive selections are supposed to be continuous random variables, we are dealing with a continuous-time optimal stopping problem which is the natural generalization of the one Rasmussen and Starr (1979) have investigated; namely, the corresponding problem with fixed times between successive selections. However, in contrast to their discrete-time setting the derivation of an optimal strategy appears to be much harder in our model as generally we are no longer in the monotone case. This note gives a general point process formulation for this problem, leading in particular to an equivalent stopping problem via stochastic intensities which is easier to handle. Then we present a formal derivation of the optimal stopping time under the stronger assumption of i.i.d. (X 1 , A 1) (X2, A2 ), · ·· where Xn gives the label (j for Sj ) of the species selected at Tn and An denotes the time between the nth and (n – 1)th selection, i.e. An = Tn – Tn– 1. In the case where even Xn and An are independent and An has an IFR (increasing failure rate) distribution, an explicit solution for the optimal strategy is derived as a simple consequence.


2014 ◽  
Vol 51 (4) ◽  
pp. 898-909
Author(s):  
Moritz Duembgen ◽  
L. C. G. Rogers

In this paper we solve the hedge fund manager's optimization problem in a model that allows for investors to enter and leave the fund over time depending on its performance. The manager's payoff at the end of the year will then depend not just on the terminal value of the fund level, but also on the lowest and the highest value reached over that time. We establish equivalence to an optimal stopping problem for Brownian motion; by approximating this problem with the corresponding optimal stopping problem for a random walk we are led to a simple and efficient numerical scheme to find the solution, which we then illustrate with some examples.


2019 ◽  
Vol 6 (11) ◽  
pp. 191423
Author(s):  
Julia Stadlmann ◽  
Radek Erban

A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences x n +1 = F ( x n ) generated by such maps display rich dynamical behaviour. The integer parts ⌊ x n ⌋ give a discrete-time random walk for a suitable initial distribution of x 0 and converge in certain limits to Brownian motion or more general Lévy processes. Furthermore, for certain shift-periodic maps with small holes on [0,1], convergence of trajectories to a continuous-time random walk is shown in a limit.


1985 ◽  
Vol 22 (2) ◽  
pp. 447-453
Author(s):  
Peter Guttorp ◽  
Reg Kulperger ◽  
Richard Lockhart

Weak convergence to reflected Brownian motion is deduced for certain upwardly drifting random walks by coupling them to a simple reflected random walk. The argument is quite elementary, and also gives the right conditions on the drift. A similar argument works for a corresponding continuous-time problem.


2002 ◽  
Vol 34 (01) ◽  
pp. 141-157 ◽  
Author(s):  
Paul Dupuis ◽  
Hui Wang

We consider a class of optimal stopping problems where the ability to stop depends on an exogenous Poisson signal process - we can only stop at the Poisson jump times. Even though the time variable in these problems has a discrete aspect, a variational inequality can be obtained by considering an underlying continuous-time structure. Depending on whether stopping is allowed at t = 0, the value function exhibits different properties across the optimal exercise boundary. Indeed, the value function is only 𝒞 0 across the optimal boundary when stopping is allowed at t = 0 and 𝒞 2 otherwise, both contradicting the usual 𝒞 1 smoothness that is necessary and sufficient for the application of the principle of smooth fit. Also discussed is an equivalent stochastic control formulation for these stopping problems. Finally, we derive the asymptotic behaviour of the value functions and optimal exercise boundaries as the intensity of the Poisson process goes to infinity or, roughly speaking, as the problems converge to the classical continuous-time optimal stopping problems.


2002 ◽  
Vol 34 (1) ◽  
pp. 141-157 ◽  
Author(s):  
Paul Dupuis ◽  
Hui Wang

We consider a class of optimal stopping problems where the ability to stop depends on an exogenous Poisson signal process - we can only stop at the Poisson jump times. Even though the time variable in these problems has a discrete aspect, a variational inequality can be obtained by considering an underlying continuous-time structure. Depending on whether stopping is allowed att= 0, the value function exhibits different properties across the optimal exercise boundary. Indeed, the value function is only𝒞0across the optimal boundary when stopping is allowed att= 0 and𝒞2otherwise, both contradicting the usual𝒞1smoothness that is necessary and sufficient for the application of the principle of smooth fit. Also discussed is an equivalent stochastic control formulation for these stopping problems. Finally, we derive the asymptotic behaviour of the value functions and optimal exercise boundaries as the intensity of the Poisson process goes to infinity or, roughly speaking, as the problems converge to the classical continuous-time optimal stopping problems.


Sign in / Sign up

Export Citation Format

Share Document