IDEAS home Printed from
   My bibliography  Save this paper

Discretisation of Stochastic Control Problems for Continuous Time Dynamics with Delay


  • Markus Fischer
  • Markus Reiss


As a main step in the numerical solution of control problems in continuous time, the controlled process is approximated by sequences of controlled Markov chains, thus discretizing time and space. A new feature in this context is to allow for delay in the dynamics. The existence of an optimal strategy with respect to the cost functional can be guaranteed in the class of relaxed controls. Weak convergence of the approximating extended Markov chains to the original process together with convergence of the associated optimal strategies is established.

Suggested Citation

  • Markus Fischer & Markus Reiss, 2005. "Discretisation of Stochastic Control Problems for Continuous Time Dynamics with Delay," SFB 649 Discussion Papers SFB649DP2005-038, Sonderforschungsbereich 649, Humboldt University, Berlin, Germany, revised Dec 2005.
  • Handle: RePEc:hum:wpaper:sfb649dp2005-038

    Download full text from publisher

    File URL:
    File Function: Revised version, 2005
    Download Restriction: no

    References listed on IDEAS

    1. Boucekkine, Raouf & Licandro, Omar & Puch, Luis A. & del Rio, Fernando, 2005. "Vintage capital and the dynamics of the AK model," Journal of Economic Theory, Elsevier, vol. 120(1), pages 39-72, January.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Salvatore Federico, 2011. "A stochastic control problem with delay arising in a pension fund model," Finance and Stochastics, Springer, vol. 15(3), pages 421-459, September.

    More about this item


    Markov; Markov chain; time dynamics; stochastic control problem;

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:hum:wpaper:sfb649dp2005-038. 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: (RDC-Team). General contact details of provider: .

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

    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.