IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v217y2025ics0167715224002566.html
   My bibliography  Save this article

Minimizing the penalized goal-reaching probability with multiple dependent risks

Author

Listed:
  • Huang, Ying
  • Peng, Jun

Abstract

We consider a robust optimal investment and reinsurance problem with multiple dependent risks for an Ambiguity-Averse Insurer (AAI), who wishes to minimize the probability that the value of the wealth process reaches a low barrier before a high goal. We assume that the insurer can purchase per-loss reinsurance for every class of insurance business and invest its surplus in a risk-free asset and a risky asset. Using the technique of stochastic control theory and solving the associated Hamilton-Jacobi-Bellman (HJB) equation, we derive the robust optimal investment-reinsurance strategy and the associated value function. We conclude that the robust optimal investment-reinsurance strategy coincides with the one without model ambiguity, but the value function differs. We also illustrate our results by numerical examples.

Suggested Citation

  • Huang, Ying & Peng, Jun, 2025. "Minimizing the penalized goal-reaching probability with multiple dependent risks," Statistics & Probability Letters, Elsevier, vol. 217(C).
    • Handle: RePEc:eee:stapro:v:217:y:2025:i:c:s0167715224002566
    DOI: 10.1016/j.spl.2024.110287
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715224002566
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2024.110287?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.

    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:eee:stapro:v:217:y:2025:i:c:s0167715224002566. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.