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

Efficient Computation of Optimal Trading Strategies

Author

Listed:
  • Victor Boyarshinov
  • Malik Magdon-Ismail

Abstract

Given the return series for a set of instruments, a \emph{trading strategy} is a switching function that transfers wealth from one instrument to another at specified times. We present efficient algorithms for constructing (ex-post) trading strategies that are optimal with respect to the total return, the Sterling ratio and the Sharpe ratio. Such ex-post optimal strategies are useful analysis tools. They can be used to analyze the "profitability of a market" in terms of optimal trading; to develop benchmarks against which real trading can be compared; and, within an inductive framework, the optimal trades can be used to to teach learning systems (predictors) which are then used to identify future trading opportunities.

Suggested Citation

  • Victor Boyarshinov & Malik Magdon-Ismail, 2010. "Efficient Computation of Optimal Trading Strategies," Papers 1009.4683, arXiv.org.
  • Handle: RePEc:arx:papers:1009.4683
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1009.4683
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. repec:bla:jfinan:v:59:y:2004:i:1:p:289-338 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Mogens Graf Plessen & Alberto Bemporad, 2017. "A posteriori multi-stage optimal trading under transaction costs and a diversification constraint," Papers 1709.07527, arXiv.org, revised Apr 2018.

    More about this item

    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:1009.4683. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.