IDEAS home Printed from https://ideas.repec.org/a/taf/uaajxx/v12y2008i3p319-335.html
   My bibliography  Save this article

Ordering Ruin Probabilities Resulting from Layer-Based Claim Amounts for Surplus Process Perturbed by Diffusion

Author

Listed:
  • Cary Chi-Liang Tsai

Abstract

In this paper we study orders of pairs of ruin probabilities resulting from two claim severity random variables X and Y for a continuous time surplus process perturbed by diffusion, each of which is the underlying risk Z with or without a deductible and/or a policy limit imposed, called a layer of Z. The deductibles and policy limits for X and Y could be the same or different. Under some condition regarding the relative security loadings, we find that the layer with a policy limit and the layer with a deductible yield the lowest and highest ruin probabilities, respectively, provided that Z has a decreasing failure rate, and the layer with and the layer without both a deductible and a policy limit produce the smallest and largest ruin probabilities, respectively, provided that Z has an increasing failure rate. Numerical examples are also given to illustrate the results of the proposed theorems for ordering ruin probabilities resulting from layers of two random variables distributed as a single exponential and a mixture of two exponentials.

Suggested Citation

  • Cary Chi-Liang Tsai, 2008. "Ordering Ruin Probabilities Resulting from Layer-Based Claim Amounts for Surplus Process Perturbed by Diffusion," North American Actuarial Journal, Taylor & Francis Journals, vol. 12(3), pages 319-335.
  • Handle: RePEc:taf:uaajxx:v:12:y:2008:i:3:p:319-335
    DOI: 10.1080/10920277.2008.10597524
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/10920277.2008.10597524?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:uaajxx:v:12:y:2008:i:3:p:319-335. 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/uaaj .

    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.