IDEAS home Printed from https://ideas.repec.org/a/taf/sactxx/v2024y2024i6p533-560.html
   My bibliography  Save this article

Aggregate Markov models in life insurance: estimation via the EM algorithm

Author

Listed:
  • Jamaal Ahmad
  • Mogens Bladt

Abstract

In this paper, we consider statistical estimation of time–inhomogeneous aggregate Markov models. Unaggregated models, which corresponds to Markov chains, are commonly used in multi–state life insurance to model the biometric states of an insured. By aggregating microstates to each biometric state, we are able to model dependencies between transitions of the biometric states as well as the distribution of occupancy in these. This allows for non–Markovian modelling in general. Since only paths of the macrostates are observed, we develop an expectation–maximisation (EM) algorithm to obtain maximum likelihood estimates of transition intensities on the micro level. Special attention is given to a semi-Markovian case, known as the reset property, which leads to simplified estimation procedures where EM algorithms for inhomogeneous phase–type distributions can be used as building blocks. We provide a numerical example of the latter in combination with piecewise constant transition rates in a three–state disability model with data simulated from a time–inhomogeneous semi–Markov model. Comparisons of our fits with more classic GLM-based fits as well as true and empirical distributions are provided to relate our model to existing models and their tools.

Suggested Citation

  • Jamaal Ahmad & Mogens Bladt, 2024. "Aggregate Markov models in life insurance: estimation via the EM algorithm," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 2024(6), pages 533-560, July.
  • Handle: RePEc:taf:sactxx:v:2024:y:2024:i:6:p:533-560
    DOI: 10.1080/03461238.2023.2277786
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03461238.2023.2277786?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:sactxx:v:2024:y:2024:i:6:p:533-560. 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/sact .

    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.