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

Optimal insurance design under Vajda condition and exclusion clauses

Author

Listed:
  • Yanhong Chen
  • Yijun Hu

Abstract

In this paper, we explore the optimal insurance problem where the exclusion clause is taken into account. Assume that the insurable loss is mutually exclusive from another loss that is denied in the insurance coverage. Our objective is to characterize the optimal insurance strategy by minimizing the risk-adjusted value of a policyholder’s liability, where the unexpected loss is calculated by either the value at risk (VaR) or the tail value at risk (TVaR). To prevent moral hazard and to reflect the spirit of insurance, we analyze the optimal solutions over the class of ceded loss functions such that the policyholder’s retained loss and the proportion paid by an insurer are both increasing. We show that every admissible insurance contract is suboptimal to a ceded loss function composed of three interconnected line segments if the insurance premium principles satisfy risk loading and convex order preserving. The form of optimal insurance can be further simplified if the premium principles satisfies an additional weak property. Finally, we derive the optimal insurance explicitly for the expected value principle and Wang’s principle.

Suggested Citation

  • Yanhong Chen & Yijun Hu, 2022. "Optimal insurance design under Vajda condition and exclusion clauses," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(18), pages 6268-6295, September.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:18:p:6268-6295
    DOI: 10.1080/03610926.2020.1860223
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2020.1860223?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:51:y:2022:i:18:p:6268-6295. 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.