IDEAS home Printed from https://ideas.repec.org/a/eee/insuma/v53y2013i1p237-251.html
   My bibliography  Save this article

A heavy traffic approach to modeling large life insurance portfolios

Author

Listed:
  • Blanchet, Jose
  • Lam, Henry

Abstract

We explore a new framework to approximate life insurance risk processes in the scenario of plentiful policyholders, via a bottom-up approach. Given the insurance contract structure, we aggregate the balance of individual policy accounts, and derive an approximating Gaussian process with computable correlation structure. The methodology is borrowed from heavy traffic theory in the literature of many-server queues, and involves the so-called fluid and diffusion approximations. Our framework is different from the individual risk model in that it takes into account the time dimension and the specific policy structure including the premium payments. It is also different from classical risk theory in that it builds the risk process from micro-level contracts and parameters instead of assuming aggregated claim and premium processes outright. As a result, our approximating process behaves differently depending on the issued contract structure. We also illustrate the flexibility of our approach by formulating a finite-horizon ruin problem that incorporates actuarial reserve in the consideration.

Suggested Citation

  • Blanchet, Jose & Lam, Henry, 2013. "A heavy traffic approach to modeling large life insurance portfolios," Insurance: Mathematics and Economics, Elsevier, vol. 53(1), pages 237-251.
  • Handle: RePEc:eee:insuma:v:53:y:2013:i:1:p:237-251
    DOI: 10.1016/j.insmatheco.2013.04.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167668713000772
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.insmatheco.2013.04.011?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. Hüsler, J. & Piterbarg, V., 1999. "Extremes of a certain class of Gaussian processes," Stochastic Processes and their Applications, Elsevier, vol. 83(2), pages 257-271, October.
    2. Dieker, A.B., 2005. "Extremes of Gaussian processes over an infinite horizon," Stochastic Processes and their Applications, Elsevier, vol. 115(2), pages 207-248, February.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    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. Kresojević Bojan & Gajić Milica, 2019. "Application of the T-Test in Health Insurance Cost Analysis: Large Data Sets," Economics, Sciendo, vol. 7(2), pages 157-167, December.
    2. Cheung, Eric C.K. & Rabehasaina, Landy & Woo, Jae-Kyung & Xu, Ran, 2019. "Asymptotic correlation structure of discounted Incurred But Not Reported claims under fractional Poisson arrival process," European Journal of Operational Research, Elsevier, vol. 276(2), pages 582-601.

    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. Hüsler, Jürg & Zhang, Yueming, 2008. "On first and last ruin times of Gaussian processes," Statistics & Probability Letters, Elsevier, vol. 78(10), pages 1230-1235, August.
    2. Ji, Lanpeng & Peng, Xiaofan, 2023. "Extreme value theory for a sequence of suprema of a class of Gaussian processes with trend," Stochastic Processes and their Applications, Elsevier, vol. 158(C), pages 418-452.
    3. Bai, Long & Luo, Li, 2017. "Parisian ruin of the Brownian motion risk model with constant force of interest," Statistics & Probability Letters, Elsevier, vol. 120(C), pages 34-44.
    4. Pingjin Deng, 2018. "The Joint Distribution of Running Maximum of a Slepian Process," Methodology and Computing in Applied Probability, Springer, vol. 20(4), pages 1123-1135, December.
    5. Debicki, K. & Kosinski, K.M. & Mandjes, M. & Rolski, T., 2010. "Extremes of multidimensional Gaussian processes," Stochastic Processes and their Applications, Elsevier, vol. 120(12), pages 2289-2301, December.
    6. Krzysztof Dȩbicki, 2022. "Exact asymptotics of Gaussian-driven tandem queues," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 285-287, April.
    7. Bai, Long, 2020. "Extremes of standard multifractional Brownian motion," Statistics & Probability Letters, Elsevier, vol. 159(C).
    8. Krzysztof Dȩbicki & Peng Liu & Zbigniew Michna, 2020. "Sojourn Times of Gaussian Processes with Trend," Journal of Theoretical Probability, Springer, vol. 33(4), pages 2119-2166, December.
    9. Krzysztof Bisewski & Krzysztof Dȩbicki & Tomasz Rolski, 2022. "Derivative of the expected supremum of fractional Brownian motion at $$H=1$$ H = 1," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 53-68, October.
    10. De[combining cedilla]bicki, Krzysztof & Kisowski, Pawel, 2008. "Asymptotics of supremum distribution of [alpha](t)-locally stationary Gaussian processes," Stochastic Processes and their Applications, Elsevier, vol. 118(11), pages 2022-2037, November.
    11. Hüsler, Jürg & Piterbarg, Vladimir, 2008. "A limit theorem for the time of ruin in a Gaussian ruin problem," Stochastic Processes and their Applications, Elsevier, vol. 118(11), pages 2014-2021, November.
    12. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.
    13. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    14. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    15. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    16. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    17. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    18. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    19. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    20. James W. Taylor, 2012. "Density Forecasting of Intraday Call Center Arrivals Using Models Based on Exponential Smoothing," Management Science, INFORMS, vol. 58(3), pages 534-549, March.

    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:eee:insuma:v:53:y:2013:i:1:p:237-251. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505554 .

    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.