IDEAS home Printed from https://ideas.repec.org/a/cup/astinb/v53y2023i3p706-728_10.html
   My bibliography  Save this article

Reinsurance games with $\boldsymbol{{n}}$ variance-premium reinsurers: from tree to chain

Author

Listed:
  • Cao, Jingyi
  • Li, Dongchen
  • Young, Virginia R.
  • Zou, Bin

Abstract

This paper studies dynamic reinsurance contracting and competition problems under model ambiguity in a reinsurance market with one primary insurer and n reinsurers, who apply the variance premium principle and who are distinguished by their levels of ambiguity aversion. The insurer negotiates reinsurance policies with all reinsurers simultaneously, which leads to a reinsurance tree structure with full competition among the reinsurers. We model the reinsurance contracting problems between the insurer and reinsurers by Stackelberg differential games and the competition among the reinsurers by a non-cooperative Nash game. We derive equilibrium strategies in semi-closed form for all the companies, whose objective is to maximize their expected surpluses penalized by a squared-error divergence term that measures their ambiguity. We find that, in equilibrium, the insurer purchases a positive amount of proportional reinsurance from each reinsurer. We further show that the insurer always prefers the tree structure to the chain structure, in which the risk of the insurer is shared sequentially among all reinsurers.

Suggested Citation

  • Cao, Jingyi & Li, Dongchen & Young, Virginia R. & Zou, Bin, 2023. "Reinsurance games with $\boldsymbol{{n}}$ variance-premium reinsurers: from tree to chain," ASTIN Bulletin, Cambridge University Press, vol. 53(3), pages 706-728, September.
  • Handle: RePEc:cup:astinb:v:53:y:2023:i:3:p:706-728_10
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0515036123000247/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    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:cup:astinb:v:53:y:2023:i:3:p:706-728_10. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/asb .

    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.