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

Stochastic differential reinsurance and investment games with delay under VaR constraints⋆

Author

Listed:
  • Xinya He
  • Ailing Gu
  • Haixiang Yao

Abstract

This article investigates stochastic differential reinsurance and investment games with delay under Value-at-Risk (VaR) constraints. In our model, three players and two games are considered, i.e., a non-zero-sum stochastic differential game between two insurers and a stochastic Stackelberg differential game between the reinsurer and the two insurers are investigated. The reinsurer can set the reinsurance premium price and invest her surplus in a financial market consisting of a risk-free asset and a risky asset. The two insurers can purchase proportional reinsurance and invest in the same financial market. Since the delay is considered in this article, the wealth processes of three players are described by the stochastic delay differential equations. In this article, we establish two optimization problems, one is to maximize the expected utility of the reinsurer’s terminal wealth with delay, and the other is to maximize the expected utility of the combination of each insurer’s terminal wealth and relative performance with delay. Furthermore, in order to control risk, we incorporate the VaR constraints into the optimizations and derive the corresponding value functions and Nash equilibrium strategies by using optimal control theory, dynamic programming principle, backward induction, Lagrange function and Karush–Kuhn–Tucker condition. Finally, several numerical examples are given.

Suggested Citation

  • Xinya He & Ailing Gu & Haixiang Yao, 2024. "Stochastic differential reinsurance and investment games with delay under VaR constraints⋆," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(4), pages 1479-1515, February.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:4:p:1479-1515
    DOI: 10.1080/03610926.2022.2103149
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2022.2103149?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:4:p:1479-1515. 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.