Optimal prediction of the ultimate maximum of Brownian motion
Author:
- 1 August 2003
- journal article
- research article
- Published by Taylor & Francis in Stochastics and Stochastic Reports
- Vol. 75 (4) , 205-219
Abstract
At time 0 start to observe a Brownian path. Based upon the information, which is continuously updated through the observation of the path, a stopping time is determined such that the path is as close as possible to its unknown ultimate maximum over a finite time interval. The closeness is measured by a q-mean or by a probability distance. This can be formulated as an optimal stopping problem. The method of proof relies upon a representation of a conditional expectation of the gain process and the principle of smooth fit (at a single point).Keywords
This publication has 6 references indexed in Scilit:
- Stopping Brownian Motion Without Anticipation as Close as Possible to Its Ultimate MaximumTheory of Probability & Its Applications, 2001
- Solving non–linear optimal stopping problems by the method of time–changeStochastic Analysis and Applications, 2000
- Continuous Martingales and Brownian Motion1999
- Viscosity solutions of optimal stopping problemsStochastics and Stochastic Reports, 1998
- Optimal Stopping Rules and Maximal Inequalities for Bessel ProcessesTheory of Probability & Its Applications, 1994
- Optimal Stopping and Best Constants for Doob-like Inequalities I: The Case $p = 1$The Annals of Probability, 1991