IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i19p6751-6766.html
   My bibliography  Save this article

Optimal reinsurance and investment problem with the minimum capital deposit constraint

Author

Listed:
  • Linlin Tian
  • Guoqing Li
  • You Lv

Abstract

This paper studies the optimal reinsurance and investment problem of the insurance company. During the optimization phase, the existence of capital deposit requires that the insurer’s wealth should be above the given minimum value. The aim is to minimize the distance between the wealth and the given target at the terminal time. We first convert the value function’s domain to a rectangle and then derive the Hamilton-Jacobi-Bellman equation via the dynamic programming principle. By solving the explicit solutions for the Hamilton-Jacobi-Bellman equation, we obtain the expression of the optimal reinsurance and investment policy. In the last, several examples are presented to illustrate the sensitivity analysis of different parameters.

Suggested Citation

  • Linlin Tian & Guoqing Li & You Lv, 2023. "Optimal reinsurance and investment problem with the minimum capital deposit constraint," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(19), pages 6751-6766, October.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:19:p:6751-6766
    DOI: 10.1080/03610926.2023.2179372
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2179372
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2023.2179372?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:taf:lstaxx:v:52:y:2023:i:19:p:6751-6766. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.