Skip to main content
Log in

Entropy programming modeling of IBNR claims reserves

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The key focus of the paper is the introduction of a new deterministic approach to outstanding claims reserving in general insurance. The goals are to present a class of entropy programming models for determining claims reserves estimates; to justify popular simple techniques like the chain ladder technique and the separation method; to establish close connection of entropy programming models with log-linear models, maximum likelihood estimates; and to suggest new methods in the entropy programming framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bornhutter, R. L., & Ferguson, R. E. (1972). The actuary and IBNR. In Proceedings of the casualty actuarial society: Vol. LIX (pp. 181–195).

    Google Scholar 

  • Bregman, L. (1967). The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7, 200–217.

    Article  Google Scholar 

  • Buhlmann, H. (1983). Estimation of IBNR reserves by the methods chain ladder, cape cod, and complementary loss ratio. Unpublished.

  • Csiszár, I. (1967). Information type measures of difference of probability distributions and indirect observations. Studia Scientiarum Mathematicarum Hungarica, 2, 299–318.

    Google Scholar 

  • Encyclopedia (2004). Encyclopedia of actuarial science. New York: Wiley.

    Google Scholar 

  • England, P. D., & Verrall, R. J. (2002). Stochastic claims reserving in general insurance. British Actuarial Journal, 8, 443–544.

    Article  Google Scholar 

  • Fang, S.-C., Rajasekera, J. R., & Tsao, H. S. J. (1997). Entropy optimization and mathematical programming. In Kluwer’s international series. Dordrecht: Kluwer.

    Google Scholar 

  • Iusem, A. N., Svaiter, B. F., & Teboulle, M. (1994). Entropy-like proximal methods in convex programming. Mathematics of Operations Research, 19, 790–814.

    Article  Google Scholar 

  • Kaas, R., Goovaerts, M., Dhaene, J., & Denuit, M. (2001). Modern actuarial risk theory. Dordrecht: Kluwer.

    Google Scholar 

  • Kas, P., & Klafszky, E. (1993). On the duality of the mixed entropy programming. Optimization, 27(3), 253–258.

    Article  Google Scholar 

  • Kiwiel, K. C. (1997). Proximal minimization methods with generalized Bregman functions. SIAM Journal on Control and Optimization, 35, 1142–1168.

    Article  Google Scholar 

  • Mack, T. (1993). Distribution free calculation of the standard error of chain ladder estimates. ASTIN Bulletin, 23(2), 213–225.

    Article  Google Scholar 

  • Mangasarian, O. L. (1969). Nonlinear programming. New York: McGraw-Hill.

    Google Scholar 

  • Stanard, J. N. (1985). A simulation test of prediction errors of loss reserve estimation techniques. Proceedings of the Casualty Actuarial Society, LXXII, 124–148.

    Google Scholar 

  • Venter, G. (2006). Discussion of the mean square error of prediction in the chain ladder reserving method. ASTIN Bulletin, 36(2), 566–571.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Éva Komáromi.

Additional information

The research was supported by the Hungarian National Research Grant No. 77420-2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Komáromi, É. Entropy programming modeling of IBNR claims reserves. Ann Oper Res 200, 93–108 (2012). https://doi.org/10.1007/s10479-011-0882-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-011-0882-7

Keywords

Navigation