Skip to main content

Dynamic Set-Up for Designing Optimal Reinsurance Contracts

Chen, Yunzhou, Assa, H. (2019) Dynamic Set-Up for Designing Optimal Reinsurance Contracts. SSRN Electronic Journal, . (Unpublished) (doi:10.2139/ssrn.3420090) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:87824)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
https://doi.org/10.2139/ssrn.3420090

Abstract

In this paper, we consider a dynamic set-up for designing optimal reinsurance contracts. The main objective is to maximise the lifetime dividends of an insurance company. We study three problems. First, we consider a general dividend maximisation problem with just budget constraints; second, we add solvency conditions to the previous problem; and finally, we consider a problem with solvency constraints and a particular type of dividend functions. We show that the optimal solutions of the first and second problems do not evolve over time and can be found by solving a static problem, whereas the third problem's optimal solution evolves over time and depends on the problem specification and the state variables. We find the dual problem of the third problem and show that the optimal reinsurance contract always has a multilayer structure. Last, we consider some examples and show that in many cases, the contract is indeed a two-layer policy.

Item Type: Article
DOI/Identification number: 10.2139/ssrn.3420090
Subjects: H Social Sciences
Divisions: Divisions > Kent Business School - Division > Department of Accounting and Finance
Depositing User: Hirbod Assa
Date Deposited: 29 Apr 2021 14:17 UTC
Last Modified: 05 May 2021 03:14 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/87824 (The current URI for this page, for reference purposes)
Assa, H.: https://orcid.org/0000-0002-4429-8684
  • Depositors only (login required):