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

Optimal growth trajectories with finite carrying capacity

Author

Listed:
  • Francesco Caravelli
  • Lorenzo Sindoni
  • Fabio Caccioli
  • Cozmin Ududec

Abstract

We consider the problem of finding optimal strategies that maximize the average growth-rate of multiplicative stochastic processes. For a geometric Brownian motion the problem is solved through the so-called Kelly criterion, according to which the optimal growth rate is achieved by investing a constant given fraction of resources at any step of the dynamics. We generalize these finding to the case of dynamical equations with finite carrying capacity, which can find applications in biology, mathematical ecology, and finance. We formulate the problem in terms of a stochastic process with multiplicative noise and a non-linear drift term that is determined by the specific functional form of carrying capacity. We solve the stochastic equation for two classes of carrying capacity functions (power laws and logarithmic), and in both cases compute optimal trajectories of the control parameter. We further test the validity of our analytical results using numerical simulations.

Suggested Citation

  • Francesco Caravelli & Lorenzo Sindoni & Fabio Caccioli & Cozmin Ududec, 2015. "Optimal growth trajectories with finite carrying capacity," Papers 1510.05123, arXiv.org, revised Jun 2016.
  • Handle: RePEc:arx:papers:1510.05123
    as

    Download full text from publisher

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

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