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

Minimizing ruin probability under the Sparre Anderson model

Author

Listed:
  • Linlin Tian
  • Lihua Bai

Abstract

In this paper, we consider the problem of minimizing the ruin probability of an insurance company in which the surplus process follows the Sparre Andersen model. We recast this problem in a Markovian framework by adding another variable representing the time elapsed since the last claim. After Markovization, We investigate the regularity properties of the value function, and state the dynamic programming principle. Furthermore, we show that the value function is the unique constrained viscosity solution to the associated Hamilton-Jacobi-Bellman equation. Since the discount factor is not included in this model, the proof of uniqueness of the viscosity solution is tricky. To overcome this difficulty, we construct the strict viscosity supersolution. Instead of comparing the usual viscosity supersolution and subsolution, we compare the strict supersolution and the subsolution. Eventually, we show that any viscosity subsolution is less than the supersolution.

Suggested Citation

  • Linlin Tian & Lihua Bai, 2022. "Minimizing ruin probability under the Sparre Anderson model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(6), pages 1622-1636, March.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:6:p:1622-1636
    DOI: 10.1080/03610926.2021.1931887
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.1931887?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:51:y:2022:i:6:p:1622-1636. 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.