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

Robust optimal dynamic reinsurance policies under the mean-RVaR premium principle

Author

Listed:
  • Wanlu Zhang
  • Hui Meng

Abstract

This work investigates a robust optimal dynamic reinsurance problem for an ambiguity averse insurer (AAI) concerned about potential ambiguity of claim intensity. The study aims to determine a robust optimal reinsurance contract to minimize the discounted ruin probability imposed a penalization owing to model ambiguity, including discounting for the time of ruin. We suppose that the surplus process is modeled by a diffusion model. The AAI purchases reinsurance from the reinsurer to manage risk, subject to the incentive compatibility constraint, which rules out moral hazard. Moreover, the reinsurance premium is calculated based on the mean-RVaR premium principle, which generalizes the expected value premium principle and the mean-CVaR premium principle and reflects the different risk preferences of reinsurers. Based on the dynamic programming approach, we obtain the value function and optimal reinsurance policies (the dual excess-of-loss reinsurance). Finally, we show a numerical example to illustrate the effects of premium and ambiguity averse on the discounted ruin probability and the robust optimal contract.

Suggested Citation

  • Wanlu Zhang & Hui Meng, 2024. "Robust optimal dynamic reinsurance policies under the mean-RVaR premium principle," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(1), pages 113-143, January.
    • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:1:p:113-143
    DOI: 10.1080/03610926.2022.2076121
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2076121
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2022.2076121?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:53:y:2024:i:1:p:113-143. 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.