IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0908.1014.html
   My bibliography  Save this paper

Selling a stock at the ultimate maximum

Author

Listed:
  • Jacques du Toit
  • Goran Peskir

Abstract

Assuming that the stock price $Z=(Z_t)_{0\leq t\leq T}$ follows a geometric Brownian motion with drift $\mu\in\mathbb{R}$ and volatility $\sigma>0$, and letting $M_t=\max_{0\leq s\leq t}Z_s$ for $t\in[0,T]$, we consider the optimal prediction problems \[V_1=\inf_{0\leq\tau\leq T}\mathsf{E}\biggl(\frac{M_T}{Z_{\tau}}\biggr)\quadand\quad V_2=\sup_{0\leq\tau\leq T}\mathsf{E}\biggl(\frac{Z_{\tau}}{M_T}\biggr),\] where the infimum and supremum are taken over all stopping times $\tau$ of $Z$. We show that the following strategy is optimal in the first problem: if $\mu\leq0$ stop immediately; if $\mu\in (0,\sigma^2)$ stop as soon as $M_t/Z_t$ hits a specified function of time; and if $\mu\geq\sigma^2$ wait until the final time $T$. By contrast we show that the following strategy is optimal in the second problem: if $\mu\leq\sigma^2/2$ stop immediately, and if $\mu>\sigma^2/2$ wait until the final time $T$. Both solutions support and reinforce the widely held financial view that ``one should sell bad stocks and keep good ones.'' The method of proof makes use of parabolic free-boundary problems and local time--space calculus techniques. The resulting inequalities are unusual and interesting in their own right as they involve the future and as such have a predictive element.

Suggested Citation

  • Jacques du Toit & Goran Peskir, 2009. "Selling a stock at the ultimate maximum," Papers 0908.1014, arXiv.org.
  • Handle: RePEc:arx:papers:0908.1014
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0908.1014
    File Function: Latest version
    Download Restriction: no

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cohen, Albert, 2010. "Examples of optimal prediction in the infinite horizon case," Statistics & Probability Letters, Elsevier, vol. 80(11-12), pages 950-957, June.
    2. Yang, Aijun & Liu, Yue & Xiang, Ju & Yang, Hongqiang, 2016. "Optimal buying at the global minimum in a regime switching model," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 50-55.
    3. Peskir, Goran, 2012. "Optimal detection of a hidden target: The median rule," Stochastic Processes and their Applications, Elsevier, vol. 122(5), pages 2249-2263.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:0908.1014. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators). General contact details of provider: http://arxiv.org/ .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.