The classical exponential smoothing procedure to be applied to a sequence of observations is modified into some adaptive variants and also generalized to the recursive scheme

This means that given the history of observations and smoothed values up to time n, the updated smoothed value Wn + 1 is given by a function u of Wn and Xn , which satisfies only certain structural properties. We study these procedures within the framework of random systems with complete connections and exploit results from Markov process theory to study the sequence . A broad class of ‘smoothing functions' u, which induce sequences with nice statistical properties, is presented. A method to estimate the limit of the expected smoothed values is also developed.,

We consider exponential smoothing Yn = αXn + (1 − α)Yn−1, 0 < α < 1, in experience rating. Here the premium Yn is determined by the policy's own claims history (Xn). In order to uniformize the fluctuation of premiums, it is appropriate to use a bigger α for the big policies than for the small ones. When the size of the policy changes with time, a need arises to change α correspondingly. It has recently been shown that changing based on the size of the premiums Yn may lead to too low a tariff level. This result is presented here and illustrated by means of simulation. Further, some general results are given how the changing can be made without a decline in the tariff level. The results are applied to a tariff system in which the linking of the smoothing parameter to the size of the policy is particularly motivated.

An adaptive-type exponential smoothing, motivated by an insurance tariff problem, is treated. We consider the process Zn = ß(Zn – 1)Xn +(1 – ß (Zn –1))Zn –1, where Xn are i.i.d. taking values in the interval [0, M], M ≦ ∞ and ß is a monotonically increasing function [0, M] → [c, d], 0 < c < d < 1.

Together with (Zn ), we consider the ordinary exponential smoothing Yn = αXn + (1 – α)Yn – 1 where α is a constant, 0 < α < 1. We show that (Yn ) and (Zn ) are geometrically ergodic Markov chains (in the case of finite interval we even have uniform ergodicity) and that EYn, EZn converge to limits EY, EZ, respectively, with a geometric convergence rate. Moreover, we show that Ez is strictly less than EY = EXn.