IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v62y2005i2p243-253.html
   My bibliography  Save this article

Upper and lower bounds for the solutions of Markov renewal equations

Author

Listed:
  • Gang Li
  • Jiaowan Luo

Abstract

Upper and lower bounds are studied for the solutions of Markov renewal equations. Some of their special cases are derived under specific marginal conditons and in an alternating environment. The method to construct the bounds is also explained in detail. At the end, these bounds are applied to a shock model and an age-dependent branching process under Markovian environment. Copyright Springer-Verlag 2005

Suggested Citation

  • Gang Li & Jiaowan Luo, 2005. "Upper and lower bounds for the solutions of Markov renewal equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(2), pages 243-253, November.
  • Handle: RePEc:spr:mathme:v:62:y:2005:i:2:p:243-253
    DOI: 10.1007/s00186-005-0008-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-005-0008-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-005-0008-6?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.

    References listed on IDEAS

    as
    1. Asmussen, Søren & Henriksen, Lotte Fløe & Klüppelberg, Claudia, 1994. "Large claims approximations for risk processes in a Markovian environment," Stochastic Processes and their Applications, Elsevier, vol. 54(1), pages 29-43, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheung, Eric C.K. & Feng, Runhuan, 2013. "A unified analysis of claim costs up to ruin in a Markovian arrival risk model," Insurance: Mathematics and Economics, Elsevier, vol. 53(1), pages 98-109.
    2. Li, Shu & Landriault, David & Lemieux, Christiane, 2015. "A risk model with varying premiums: Its risk management implications," Insurance: Mathematics and Economics, Elsevier, vol. 60(C), pages 38-46.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Asmussen, Søren & Klüppelberg, Claudia, 1996. "Large deviations results for subexponential tails, with applications to insurance risk," Stochastic Processes and their Applications, Elsevier, vol. 64(1), pages 103-125, November.
    2. Asmussen, Søren & Klüppelberg, Claudia & Sigman, Karl, 1999. "Sampling at subexponential times, with queueing applications," Stochastic Processes and their Applications, Elsevier, vol. 79(2), pages 265-286, February.
    3. Dominik Kortschak & Stéphane Loisel & Pierre Ribereau, 2014. "Ruin problems with worsening risks or with infinite mean claims," Post-Print hal-00735843, HAL.
    4. repec:hal:wpaper:hal-00735843 is not listed on IDEAS
    5. Schlegel, Sabine, 1998. "Ruin probabilities in perturbed risk models," Insurance: Mathematics and Economics, Elsevier, vol. 22(1), pages 93-104, May.
    6. Jeffrey Collamore & Andrea Höing, 2007. "Small-time ruin for a financial process modulated by a Harris recurrent Markov chain," Finance and Stochastics, Springer, vol. 11(3), pages 299-322, July.

    More about this item

    Keywords

    Markov renewal equation; Bounds;

    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:spr:mathme:v:62:y:2005:i:2:p:243-253. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.