IDEAS home Printed from https://ideas.repec.org/h/wsi/wschap/9789814293501_0014.html
   My bibliography  Save this book chapter

Asymptotic Optimality And Asymptotic Equipartition Properties Of Log-Optimum Investment

In: THE KELLY CAPITAL GROWTH INVESTMENT CRITERION THEORY and PRACTICE

Author

Listed:
  • PAUL H. ALGOET
  • THOMAS M. COVER

Abstract

We ask how an investor (with knowledge of the past) should distribute his funds over various investment opportunities to maximize the growth rate of his compounded capital. Breiman (1961) answered this question when the stock returns for successive periods are independent, identically distributed random vectors. We prove that maximizing conditionally expected log return given currently available information at each stage is asymptotically optimum, with no restrictions on the distribution of the market process.If the market is stationary ergodic, then the maximum capital growth rate is shown to be a constant almost surely equal to the maximum expected log return given the infinite past. Indeed, log-optimum investment policies that at time n look at the n-past are sandwiched in asymptotic growth rate between policies that look at only the k-past and those that look at the infinite past, and the sandwich closes as k → ∞.

Suggested Citation

  • Paul H. Algoet & Thomas M. Cover, 2011. "Asymptotic Optimality And Asymptotic Equipartition Properties Of Log-Optimum Investment," World Scientific Book Chapters, in: Leonard C MacLean & Edward O Thorp & William T Ziemba (ed.), THE KELLY CAPITAL GROWTH INVESTMENT CRITERION THEORY and PRACTICE, chapter 14, pages 157-179, World Scientific Publishing Co. Pte. Ltd..
    • Handle: RePEc:wsi:wschap:9789814293501_0014
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/pdf/10.1142/9789814293501_0014
    Download Restriction: Ebook Access is available upon purchase.
    File URL: https://www.worldscientific.com/doi/abs/10.1142/9789814293501_0014
    Download Restriction: Ebook Access is available upon purchase.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Yifeng Guo & Xingyu Fu & Yuyan Shi & Mingwen Liu, 2018. "Robust Log-Optimal Strategy with Reinforcement Learning," Papers 1805.00205, arXiv.org.

    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:wsi:wschap:9789814293501_0014. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscientific.com/page/worldscibooks .

    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.