IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v17y2015i4d10.1007_s11009-014-9416-5.html
   My bibliography  Save this article

Discrete Time Homogeneous Markov Processes for the Study of the Basic Risk Processes

Author

Listed:
  • Guglielmo D’Amico

    (Università G. d’Annunzio di Chieti)

  • Fulvio Gismondi

    (University Guglielmo Marconi)

  • Jacques Janssen

    (Honorary professor at the Solvay Business School Universitè Libre de Bruxelles)

  • Raimondo Manca

    (Università di Roma La Sapienza)

Abstract

In this paper Markov models useful for following the time evolution of the aggregate claim amount and the claim number in the homogeneous time environment are presented. More precisely the homogeneous Markov reward processes in both discounted and not discounted cases are applied to solve the aggregate claim amount and the claim number processes respectively. In the last section the application of the proposed models is presented. Two different real-world databases are mixed for the construction of input data.

Suggested Citation

  • Guglielmo D’Amico & Fulvio Gismondi & Jacques Janssen & Raimondo Manca, 2015. "Discrete Time Homogeneous Markov Processes for the Study of the Basic Risk Processes," Methodology and Computing in Applied Probability, Springer, vol. 17(4), pages 983-998, December.
    • Handle: RePEc:spr:metcap:v:17:y:2015:i:4:d:10.1007_s11009-014-9416-5
    DOI: 10.1007/s11009-014-9416-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-014-9416-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-014-9416-5?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. Janssen, Jacques, 1980. "Some Transient Results on the M/SM/1 Special Semi-Markov Model in Risk and Queueing Theories," ASTIN Bulletin, Cambridge University Press, vol. 11(1), pages 41-51, June.
    2. Janssen, Jacques & Reinhard, Jean-Marie, 1985. "Probabilités de Ruine pour une Classe de Modèles de Risque Semi-Markoviens," ASTIN Bulletin, Cambridge University Press, vol. 15(2), pages 123-133, November.
    3. Ronald A. Howard & James E. Matheson, 1972. "Risk-Sensitive Markov Decision Processes," Management Science, INFORMS, vol. 18(7), pages 356-369, March.
    4. V. S. Borkar & S. P. Meyn, 2002. "Risk-Sensitive Optimal Control for Markov Decision Processes with Monotone Cost," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 192-209, February.
    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. Guglielmo D’Amico & Filippo Petroni & Salvatore Vergine, 2021. "An Analysis of a Storage System for a Wind Farm with Ramp-Rate Limitation," Energies, MDPI, vol. 14(13), pages 1-25, July.
    2. Guglielmo D’Amico & Shakti Singh & Dharmaraja Selvamuthu, 2023. "Analysis of fair fee in guaranteed lifelong withdrawal and Markovian health benefits," Annals of Finance, Springer, vol. 19(3), pages 383-400, September.

    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. Basu, Arnab & Ghosh, Mrinal Kanti, 2014. "Zero-sum risk-sensitive stochastic games on a countable state space," Stochastic Processes and their Applications, Elsevier, vol. 124(1), pages 961-983.
    2. Bäuerle, Nicole & Rieder, Ulrich, 2017. "Zero-sum risk-sensitive stochastic games," Stochastic Processes and their Applications, Elsevier, vol. 127(2), pages 622-642.
    3. Rolando Cavazos-Cadena, 2018. "Characterization of the Optimal Risk-Sensitive Average Cost in Denumerable Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 1025-1050, August.
    4. Julio Saucedo-Zul & Rolando Cavazos-Cadena & Hugo Cruz-Suárez, 2020. "A Discounted Approach in Communicating Average Markov Decision Chains Under Risk-Aversion," Journal of Optimization Theory and Applications, Springer, vol. 187(2), pages 585-606, November.
    5. Gustavo Portillo-Ramírez & Rolando Cavazos-Cadena & Hugo Cruz-Suárez, 2023. "Contractive approximations in average Markov decision chains driven by a risk-seeking controller," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 75-91, August.
    6. Rolando Cavazos-Cadena & Daniel Hernández-Hernández, 2011. "Discounted Approximations for Risk-Sensitive Average Criteria in Markov Decision Chains with Finite State Space," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 133-146, February.
    7. Arnab Basu & Mrinal K. Ghosh, 2018. "Nonzero-Sum Risk-Sensitive Stochastic Games on a Countable State Space," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 516-532, May.
    8. Schmidli, Hanspeter, 2001. "Distribution of the first ladder height of a stationary risk process perturbed by [alpha]-stable Lévy motion," Insurance: Mathematics and Economics, Elsevier, vol. 28(1), pages 13-20, February.
    9. Rolando Cavazos-Cadena & Raúl Montes-de-Oca, 2003. "The Value Iteration Algorithm in Risk-Sensitive Average Markov Decision Chains with Finite State Space," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 752-776, November.
    10. Karel Sladký, 2013. "Risk-Sensitive and Mean Variance Optimality in Markov Decision Processes," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 7(3), pages 146-161, November.
    11. Rubén Blancas-Rivera & Rolando Cavazos-Cadena & Hugo Cruz-Suárez, 2020. "Discounted approximations in risk-sensitive average Markov cost chains with finite state space," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(2), pages 241-268, April.
    12. Arnab Basu & Tirthankar Bhattacharyya & Vivek S. Borkar, 2008. "A Learning Algorithm for Risk-Sensitive Cost," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 880-898, November.
    13. Brias, Antoine & Munch, Stephan B., 2021. "Ecosystem based multi-species management using Empirical Dynamic Programming," Ecological Modelling, Elsevier, vol. 441(C).
    14. Pestien, Victor & Wang, Xiaobo, 1998. "Markov-achievable payoffs for finite-horizon decision models," Stochastic Processes and their Applications, Elsevier, vol. 73(1), pages 101-118, January.
    15. Bhabak, Arnab & Saha, Subhamay, 2022. "Risk-sensitive semi-Markov decision problems with discounted cost and general utilities," Statistics & Probability Letters, Elsevier, vol. 184(C).
    16. Albrecher, Hansjorg & Boxma, Onno J., 2005. "On the discounted penalty function in a Markov-dependent risk model," Insurance: Mathematics and Economics, Elsevier, vol. 37(3), pages 650-672, December.
    17. Lucy Gongtao Chen & Daniel Zhuoyu Long & Melvyn Sim, 2015. "On Dynamic Decision Making to Meet Consumption Targets," Operations Research, INFORMS, vol. 63(5), pages 1117-1130, October.
    18. Zeynep Erkin & Matthew D. Bailey & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2010. "Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach," Decision Analysis, INFORMS, vol. 7(4), pages 358-365, December.
    19. Nicole Bäuerle & Ulrich Rieder, 2014. "More Risk-Sensitive Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 105-120, February.
    20. Carlos Camilo-Garay & Rolando Cavazos-Cadena & Hugo Cruz-Suárez, 2022. "Contractive Approximations in Risk-Sensitive Average Semi-Markov Decision Chains on a Finite State Space," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 271-291, January.

    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:metcap:v:17:y:2015:i:4:d:10.1007_s11009-014-9416-5. 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.