Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-23T22:21:50.713Z Has data issue: false hasContentIssue false
  • English
  • Français

A General ‘Bang-Bang’ Principle for Predicting the Maximum of a Random Walk

Part of: Markov processes Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Pieter Allaart
Pieter Allaart*
Affiliation:
University of North Texas
*
∗Postal address: Department of Mathematics, University of North Texas, 1155 Union Circle #311430, Denton, TX 76203-5017, USA. Email address: allaart@unt.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let (Bt)0≤t≤T be either a Bernoulli random walk or a Brownian motion with drift, and let Mt := max{Bs: 0 ≤ s ≤ t}, 0 ≤ t ≤ T. In this paper we solve the general optimal prediction problem sup0≤τ≤TE[f(MT − Bτ], where the supremum is over all stopping times τ adapted to the natural filtration of (Bt) and f is a nonincreasing convex function. The optimal stopping time τ* is shown to be of ‘bang-bang’ type: τ* ≡ 0 if the drift of the underlying process (Bt) is negative and τ* ≡ T if the drift is positive. This result generalizes recent findings of Toit and Peskir (2009) and Yam, Yung and Zhou (2009), and provides additional mathematical justification for the dictum in finance that one should sell bad stocks immediately, but keep good stocks as long as possible.

Keywords

Bernoulli random walkBrownian motionoptimal predictionultimate maximumstopping timeconvex function

MSC classification

Secondary: 60G40: Stopping times; optimal stopping problems; gambling theory 60G50: Sums of independent random variables; random walks 60J65: Brownian motion 60G25: Prediction theory
Type
Research Article
Information
Journal of Applied Probability , Volume 47 , Issue 4 , December 2010 , pp. 1072 - 1083
Copyright
Copyright © Applied Probability Trust 2010 

Footnotes

Supported in part by the Japanese GCOE Program G08: ‘Fostering Top Leaders in Mathematics-Broadening the Core and Exploring New Ground’.

References

[1] Du Toit, J. and Peskir, G. (2009). Selling a stock at the ultimate maximum. Ann. Appl. Prob. 19, 983–1014.Google Scholar
[2] Graversen, S. E., Peskir, G. and Shiryaev, A. N. (2000). Stopping Brownian motion without anticipation as close as possible to its ultimate maximum. Theory Prob. Appl. 45, 41–50.Google Scholar
[3] Hlynka, M. and Sheahan, J. N. (1988). The secretary problem for a random walk. Stoch. Process. Appl. 28, 317–325.Google Scholar
[4] Pedersen, J. L. (2003). Optimal prediction of the ultimate maximum of Brownian motion. Stoch. Stoch. Reports 75, 205–219.Google Scholar
[5] Shiryaev, A. N., Xu, Z. and Zhou, X. Y. (2008). Thou shalt buy and hold. Quant. Finance 8, 765–776.Google Scholar
[6] Yam, S. C. P., Yung, S. P. and Zhou, W. (2009). Two rationales behind the ‘buy-and-hold or sell-at-once’ strategy. J. Appl. Prob. 46, 651–668.Google Scholar