IDEAS home Printed from https://ideas.repec.org/a/cup/astinb/v41y2011i01p131-155_00.html
   My bibliography  Save this article

Maximum Likelihood and Estimation Efficiency of the Chain Ladder

Author

Listed:
  • Taylor, Greg

Abstract

The chain ladder is considered in relation to certain recursive and non-recursive models of claim observations. The recursive models resemble the (distribution free) Mack model but are augmented with distributional assumptions. The non-recursive models are generalisations of Poisson cross-classified structure for which the chain ladder is known to be maximum likelihood. The error distributions considered are drawn from the exponential dispersion family. Each of these models is examined with respect to sufficient statistics and completeness (Section 5), minimum variance estimators (Section 6) and maximum likelihood (Section 7). The chain ladder is found to provide maximum likelihood and minimum variance unbiased estimates of loss reserves under a wide range of recursive models. Similar results are obtained for a much more restricted range of non-recursive models. These results lead to a full classification of this paper's chain ladder models with respect to the estimation properties (bias, minimum variance) of the chain ladder algorithm (Section 8).

Suggested Citation

  • Taylor, Greg, 2011. "Maximum Likelihood and Estimation Efficiency of the Chain Ladder," ASTIN Bulletin, Cambridge University Press, vol. 41(1), pages 131-155, May.
    • Handle: RePEc:cup:astinb:v:41:y:2011:i:01:p:131-155_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0515036100000787/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Taylor, Greg, 2019. "A Cape Cod model for the exponential dispersion family," Insurance: Mathematics and Economics, Elsevier, vol. 85(C), pages 126-137.
    2. Taylor, Greg, 2021. "A special Tweedie sub-family with application to loss reserving prediction error," Insurance: Mathematics and Economics, Elsevier, vol. 101(PB), pages 262-288.
    3. Greg Taylor, 2019. "Loss Reserving Models: Granular and Machine Learning Forms," Risks, MDPI, vol. 7(3), pages 1-18, July.
    4. Portugal, Luís & Pantelous, Athanasios A. & Verrall, Richard, 2021. "Univariate and multivariate claims reserving with Generalized Link Ratios," Insurance: Mathematics and Economics, Elsevier, vol. 97(C), pages 57-67.

    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:cup:astinb:v:41:y:2011:i:01:p:131-155_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/asb .

    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.