Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • FROM RUIN TO BANKRUPTCY FOR COMPOUND POISSON SURPLUS PROCESSES

  • Hansjörg Albrecher, Volkmar Lautscham
  • Journal:
    ASTIN Bulletin: The Journal of the IAA / Volume 43 / Issue 2 / May 2013
    Published online by Cambridge University Press:
    18 June 2013, pp. 213-243
    Print publication:
    May 2013

  • In classical risk theory, the infinite-time ruin probability of a surplus process Ct is calculated as the probability of the process becoming negative at some point in time. In this paper, we consider a relaxation of the ruin concept to the concept of bankruptcy, according to which one has a positive surplus-dependent probability to continue despite temporary negative surplus. We study the resulting bankruptcy probability for the compound Poisson risk model with exponential claim sizes for different bankruptcy rate functions, deriving analytical results, upper and lower bounds as well as an efficient simulation method. Numerical examples are given and the results are compared with the classical ruin probabilities. Finally, it is illustrated how the analysis can be extended to study the discounted penalty function under this relaxed ruin criterion.