IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2409.09091.html
   My bibliography  Save this paper

Claims processing and costs under capacity constraints

Author

Listed:
  • Filip Lindskog
  • Mario V. Wuthrich

Abstract

Random delays between the occurrence of accident events and the corresponding reporting times of insurance claims is a standard feature of insurance data. The time lag between the reporting and the processing of a claim depends on whether the claim can be processed without delay as it arrives or whether it remains unprocessed for some time because of temporarily insufficient processing capacity that is shared between all incoming claims. We aim to explain and analyze the nature of processing delays and build-up of backlogs. We show how to select processing capacity optimally in order to minimize claims costs, taking delay-adjusted costs and fixed costs for claims settlement capacity into account. Theoretical results are combined with a large-scale numerical study that demonstrates practical usefulness of our proposal.

Suggested Citation

  • Filip Lindskog & Mario V. Wuthrich, 2024. "Claims processing and costs under capacity constraints," Papers 2409.09091, arXiv.org.
  • Handle: RePEc:arx:papers:2409.09091
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2409.09091
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Julien Trufin & Hansjörg Albrecher & Michel Denuit, 2011. "Ruin problems under IBNR dynamics," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 27(6), pages 619-632, November.
    2. Constantinos Maglaras & Assaf Zeevi, 2003. "Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations," Management Science, INFORMS, vol. 49(8), pages 1018-1038, August.
    3. Trufin, Julien & Albrecher, Hansjorg & Denuit, Michel, 2011. "Ruin problems under IBNR dynamics," LIDAM Reprints ISBA 2011045, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    4. Stadje, Wolfgang, 1997. "A new approach to the Lindley recursion," Statistics & Probability Letters, Elsevier, vol. 31(3), pages 169-175, January.
    5. Boogaert, P. & Haezendonck, J., 1989. "Delay in claim settlement," Insurance: Mathematics and Economics, Elsevier, vol. 8(4), pages 321-330, December.
    6. Yan Chen & Ward Whitt, 2020. "Algorithms for the upper bound mean waiting time in the GI/GI/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 327-356, April.
    Full references (including those not matched with items on IDEAS)

    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. Lingjiong Zhu, 2023. "A delayed dual risk model," Papers 2301.06450, arXiv.org.
    2. He Liu & Zhenhua Bao, 2015. "On a Discrete Interaction Risk Model with Delayed Claims," JRFM, MDPI, vol. 8(4), pages 1-14, September.
    3. Chehade, Abdallah & Savargaonkar, Mayuresh & Krivtsov, Vasiliy, 2022. "Conditional Gaussian mixture model for warranty claims forecasting," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    4. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    5. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    6. Wouter van Eekelen & Dick den Hertog & Johan S.H. van Leeuwaarden, 2022. "MAD Dispersion Measure Makes Extremal Queue Analysis Simple," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1681-1692, May.
    7. Ramandeep S. Randhawa & Sunil Kumar, 2008. "Usage Restriction and Subscription Services: Operational Benefits with Rational Users," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 429-447, December.
    8. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    9. Mustafa Akan & Bar{i}c{s} Ata & Martin A. Lariviere, 2011. "Asymmetric Information and Economies of Scale in Service Contracting," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 58-72, September.
    10. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    11. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    12. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    13. Omar Besbes & Costis Maglaras, 2009. "Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment," Operations Research, INFORMS, vol. 57(6), pages 1438-1450, December.
    14. Brekelmans, Ruud & De Waegenaere, Anja, 2001. "Approximating the finite-time ruin probability under interest force," Insurance: Mathematics and Economics, Elsevier, vol. 29(2), pages 217-229, October.
    15. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    16. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.
    17. Mor Armony & Erica Plambeck & Sridhar Seshadri, 2009. "Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV)," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 19-32, June.
    18. Jayakrishnan Nair & Adam Wierman & Bert Zwart, 2016. "Provisioning of Large-Scale Systems: The Interplay Between Network Effects and Strategic Behavior in the User Base," Management Science, INFORMS, vol. 62(6), pages 1830-1841, June.
    19. Pierre L’Ecuyer & Patrick Maillé & Nicolás E. Stier-Moses & Bruno Tuffin, 2017. "Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers," Operations Research, INFORMS, vol. 65(2), pages 408-423, April.
    20. Sunil Kumar & Ramandeep S. Randhawa, 2010. "Exploiting Market Size in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 511-526, September.

    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:arx:papers:2409.09091. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.