IDEAS home Printed from https://ideas.repec.org/a/taf/uaajxx/v30y2026i2p282-303.html

Optimal Reinsurance Design under Ambiguity and Value-at-Risk Preference with Wasserstein and Lk Distance Metrics

Author

Listed:
  • Wenjun Jiang
  • Xiangying Mao
  • Heng Xiong

Abstract

This article delves into the optimal reinsurance problem from the perspective of a decision maker (DM) who exhibits a preference for value-at-risk (VaR) and experiences ambiguity regarding the underlying loss distribution. The uncertainty set considered in this study encompasses distributions that closely envelop a reference distribution, with the proximity quantified using the Wasserstein metric. Through a rigorous analysis, we present a thorough characterization of both the optimal indemnity function and the worst-case VaR for our proposed problem. Furthermore, we extend our examination to a pertinent problem wherein the Lk distance metric substitutes for the Wasserstein metric. Numerical examples are provided to demonstrate the implications of our main findings, and a comparative analysis is conducted with relevant literature to further enhance our understanding of the outcomes. Explicit comparative analysis demonstrates that Wasserstein ambiguity sets minimize worst-case VaR through aggregate tail mass shifting penalties, while Lk distance ambiguity sets prioritize local distributional shifts near the VaR quantile, generating higher worst-case VaR estimates particularly sensitive to extreme-loss scenarios. The insights and analytical tools elucidated in this article hold consequential implications for insurers and reinsurers in proficiently navigating risk management within an uncertain environment.

Suggested Citation

  • Wenjun Jiang & Xiangying Mao & Heng Xiong, 2026. "Optimal Reinsurance Design under Ambiguity and Value-at-Risk Preference with Wasserstein and Lk Distance Metrics," North American Actuarial Journal, Taylor & Francis Journals, vol. 30(2), pages 282-303, April.
  • Handle: RePEc:taf:uaajxx:v:30:y:2026:i:2:p:282-303
    DOI: 10.1080/10920277.2025.2558685
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10920277.2025.2558685
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/10920277.2025.2558685?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

    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:uaajxx:v:30:y:2026:i:2:p:282-303. 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/uaaj .

    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.