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

Optimal reinsurance: minimize the expected time to reach a goal

Author

Listed:
  • Shangzhen Luo
  • Mingming Wang
  • Xudong Zeng

Abstract

In this paper, we consider an optimal reinsurance problem. The surplus model of the insurance company is approximated by a diffusion model with the drift coefficient μ$ \mu $. The insurance company employs reinsurance to reduce the risk. π$ \pi $ is the proportion of each claim paid by the company and the remainder proportion of the claim is paid by the reinsurer. λ(1-π)$ \lambda (1-\pi ) $ is the rate at which the premiums are diverted to the reinsurer, thus it holds λ≥μ>0$ \lambda \ge \mu >0 $ in general. We discuss two cases: (i) non-cheap reinsurance (when λ>μ$ \lambda >\mu $), (ii) cheap reinsurance (when λ=μ$ \lambda =\mu $). The objective of the insurance company is to make an optimal decision on reinsurance to reach a goal (a given surplus level) in minimal expected time. We disclose that for some case it is not suitable to search optimal decisions by minimizing the expected time to reach a goal. In order to deal with this case, we study two other methodologies (ruin probability minimization and expected discount factor maximization) for the optimal strategy selection problem in reinsurance decision.

Suggested Citation

  • Shangzhen Luo & Mingming Wang & Xudong Zeng, 2016. "Optimal reinsurance: minimize the expected time to reach a goal," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 2016(8), pages 741-762, September.
  • Handle: RePEc:taf:sactxx:v:2016:y:2016:i:8:p:741-762
    DOI: 10.1080/03461238.2015.1015161
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03461238.2015.1015161?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:2016:y:2016:i:8:p:741-762. 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.