Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T02:33:48.618Z Has data issue: false hasContentIssue false

EVOLUTIONARY HIERARCHICAL CREDIBILITY

Published online by Cambridge University Press:  02 November 2017

Greg Taylor*
Affiliation:
UNSW Business School, Level 6, East Lobby, UNSW Business School Building E12, 2052 Sydney, Australia. Phone: +61 (0) 421 338 448.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The hierarchical credibility model was introduced, and extended, in the 70s and early 80s. It deals with the estimation of parameters that characterize the nodes of a tree structure. That model is limited, however, by the fact that its parameters are assumed fixed over time. This causes the model's parameter estimates to track the parameters poorly when the latter are subject to variation over time. This paper seeks to remove this limitation by assuming the parameters in question to follow a process akin to a random walk over time, producing an evolutionary hierarchical model. The specific form of the model is compatible with the use of the Kalman filter for parameter estimation and forecasting. The application of the Kalman filter is conceptually straightforward, but the tree structure of the model parameters can be extensive, and some effort is required to retain organization of the updating algorithm. This is achieved by suitable manipulation of the graph associated with the tree. The graph matrix then appears in the matrix calculations inherent in the Kalman filter. A numerical example is included to illustrate the application of the filter to the model.

Information

Type
Research Article
Copyright
Copyright © Astin Bulletin 2017