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

Time-consistent reinsurance and investment strategies for an AAI under smooth ambiguity utility

Author

Listed:
  • Guohui Guan
  • Xiaojun Wang

Abstract

This paper investigates time-consistent reinsurance(excess-of-loss, proportional) and investment strategies for an ambiguity averse insurer(abbr. AAI). The AAI is ambiguous towards the insurance and financial markets. In the AAI's attitude, the intensity of the insurance claims' number and the market price of risk of a stock can not be estimated accurately. This formulation of ambiguity is similar to the uncertainty of different equivalent probability measures. The AAI can purchase excess-of-loss or proportional reinsurance to hedge the insurance risk and invest in a financial market with cash and an ambiguous stock. We investigate the optimization goal under smooth ambiguity given in Klibanoff, P., Marinacci, M., & Mukerji, S. [(2005). A smooth model of decision making under ambiguity. Econometrica 73, 1849–1892], which aims to search the optimal strategies under average case. The utility function does not satisfy the Bellman's principle and we employ the extended HJB equation proposed in Björk, T. & Murgoci, A. [(2014). A theory of Markovian time-inconsistent stochastic control in discrete time. Finance and Stochastics 18(3), 545–592] to solve this problem. In the end of this paper, we derive the equilibrium reinsurance and investment strategies under smooth ambiguity and present the sensitivity analysis to show the AAI's economic behaviors.

Suggested Citation

  • Guohui Guan & Xiaojun Wang, 2020. "Time-consistent reinsurance and investment strategies for an AAI under smooth ambiguity utility," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 2020(8), pages 677-699, September.
    • Handle: RePEc:taf:sactxx:v:2020:y:2020:i:8:p:677-699
    DOI: 10.1080/03461238.2020.1719880
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03461238.2020.1719880
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03461238.2020.1719880?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thomas J. Sargent & John Stachurski, 2024. "Dynamic Programming: Finite States," Papers 2401.10473, arXiv.org.

    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:2020:y:2020:i:8:p:677-699. 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.