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

Bertram's Pairs Trading Strategy with Bounded Risk

Author

Listed:
  • Vladim'ir Hol'y
  • Michal v{C}ern'y

Abstract

Finding Bertram's optimal trading strategy for a pair of cointegrated assets following the Ornstein--Uhlenbeck price difference process can be formulated as an unconstrained convex optimization problem for maximization of expected profit per unit of time. This model is generalized to the form where the riskiness of profit, measured by its per-time-unit volatility, is controlled (e.g. in case of existence of limits on riskiness of trading strategies imposed by regulatory bodies). The resulting optimization problem need not be convex. In spite of this undesirable fact, it is demonstrated that the problem is still efficiently solvable. In addition, the problem that parameters of the price difference process are never known exactly and are imprecisely estimated from an observed finite sample is investigated (recalling that this problem is critical for practice). It is shown how the imprecision affects the optimal trading strategy by quantification of the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly. The main results focus on the geometric and optimization-theoretic viewpoint of the risk-bounded trading strategy and the imprecision resulting from the statistical estimates.

Suggested Citation

  • Vladim'ir Hol'y & Michal v{C}ern'y, 2021. "Bertram's Pairs Trading Strategy with Bounded Risk," Papers 2102.04160, arXiv.org, revised Jun 2021.
  • Handle: RePEc:arx:papers:2102.04160
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2102.04160
    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. Josef Jablonský & Michal Černý & Juraj Pekár, 2022. "The last dozen of years of OR research in Czechia and Slovakia," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(2), pages 435-447, June.

    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:2102.04160. See general information about how to correct material in RePEc.

    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 bibliographic 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.

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

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.