IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i1p544-568.html
   My bibliography  Save this article

Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon

Author

Listed:
  • Chonghu Guan

    (School of Mathematics, Jiaying University, Meizhou 514015, China)

  • Zuo Quan Xu

    (Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China)

  • Rui Zhou

    (Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China)

Abstract

This paper studies a dynamic optimal reinsurance and dividend-payout problem for an insurance company in a finite time horizon. The goal of the company is to maximize the expected cumulative discounted dividend payouts until bankruptcy or maturity, whichever comes earlier. The company is allowed to buy reinsurance contracts dynamically over the whole time horizon to cede its risk exposure with other reinsurance companies. This is a mixed singular–classical stochastic control problem, and the corresponding Hamilton–Jacobi–Bellman equation is a variational inequality with a fully nonlinear operator and subject to a gradient constraint. We obtain the C 2 , 1 smoothness of the value function and a comparison principle for its gradient function by the penalty approximation method so that one can establish an efficient numerical scheme to compute the value function. We find that the surplus-time space can be divided into three nonoverlapping regions by a risk-magnitude and time-dependent reinsurance barrier and a time-dependent dividend-payout barrier. The insurance company should be exposed to a higher risk as its surplus increases, be exposed to the entire risk once its surplus upward crosses the reinsurance barrier, and pay out all its reserves exceeding the dividend-payout barrier. The estimated localities of these regions are also provided.

Suggested Citation

  • Chonghu Guan & Zuo Quan Xu & Rui Zhou, 2023. "Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 544-568, February.
  • Handle: RePEc:inm:ormoor:v:48:y:2023:i:1:p:544-568
    DOI: 10.1287/moor.2022.1276
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1276
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.1276?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:1:p:544-568. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.