IDEAS home Printed from https://ideas.repec.org/a/taf/sactxx/v2023y2023i1p20-37.html
   My bibliography  Save this article

Optimal insurance strategy in a risk process under a safety level imposed on the increments of the process

Author

Listed:
  • A. Y. Golubin
  • V. N. Gridin

Abstract

The problem of designing an optimal insurance strategy in a modification of the risk process with discrete time is investigated. This model introduces stage-by-stage probabilistic constraints (Value-at-Risk (VaR) constraints) on the insurer's capital increments during each stage. Also, the set of admissible insurances is determined by a safety level reflecting a ‘good’ or ‘bad’ capital increment at the previous stage. The mathematical expectation of the insurer's final capital is used as the objective functional. The total loss of the insurer at each stage is modeled by the Gaussian (normal) distribution with parameters depending on a seded loss function (or, in other words, an insurance policy) selected. In contrast to traditional dynamic optimization models for insurance strategies, the proposed approach allows to construct the value functions (and hence the optimal insurance policies) by simply solving a sequence of static insurance optimization problems. It is demonstrated that the optimal seded loss function at each stage depends on the prescribed value of the safety level: it is either a stop-loss insurance or conditional deductible insurance having a discontinuous point. In order to reduce ex post moral hazard, we also investigate the case, where both parties in an insurance contract are obligated to pay more for a larger realization of loss. This leads to that the optimal seeded loss functions are either stop-loss insurances or unconditional deductible insurances.

Suggested Citation

  • A. Y. Golubin & V. N. Gridin, 2023. "Optimal insurance strategy in a risk process under a safety level imposed on the increments of the process," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 2023(1), pages 20-37, January.
  • Handle: RePEc:taf:sactxx:v:2023:y:2023:i:1:p:20-37
    DOI: 10.1080/03461238.2022.2075282
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03461238.2022.2075282?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:sactxx:v:2023:y:2023:i:1:p:20-37. 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/sact .

    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.