01.06.2015 Views

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

328 <strong>Actuarial</strong> <strong>Modelling</strong> <strong>of</strong> <strong>Claim</strong> <strong>Counts</strong><br />

In words, N • is the total number <strong>of</strong> claims reported by the policyholder during the period<br />

0t and I • is the number <strong>of</strong> years without any claim reported to the company. Note that<br />

the CRM coefficients depend on t, so that the penalties and discounts may change for every<br />

0t period.<br />

To obtain the parameters t and t , we minimize the expected squared difference between<br />

the ‘true’ relative premium and the relative premium r t t<br />

applicable to the policyholder<br />

according to the French-type bonus-malus system. More specifically, for a policyholder<br />

observed during t years, and having filed N 1 N 2 N t claims, we aim to determine t and<br />

t so as to minimize the objective function<br />

t = − r N • I • t 2<br />

with respect to the arguments and . We therefore have to solve the first order conditions<br />

<br />

t = 0<br />

and<br />

<br />

t = 0<br />

which rewrites as<br />

⎧<br />

⎨ [ ]<br />

N • 1 + N •−1 1 − I • − 1 + <br />

N •1 − <br />

I • = 0<br />

⎩<br />

[ ]<br />

I • 1 + N • 1 − <br />

I • −1 − 1 + N • 1 − <br />

I • = 0<br />

⎧<br />

⎨ [ [ ]<br />

N • 1 + N •−1 1 − •] I = N• 1 + 2N •−1 1 − 2I •<br />

⇐⇒<br />

⎩<br />

[ I • 1 + ] N • 1 − <br />

I • −1<br />

= [ I • 1 + ] 2N • 1 − <br />

2I • −1<br />

<br />

(9.2)<br />

9.2.4 Computation <strong>of</strong> the CRMs at Time t<br />

Let us define the conditional probability generating function <strong>of</strong> the random couple N • I • <br />

given = as<br />

1 2 = N •<br />

1 I •<br />

2<br />

= <br />

The conditional independence assumption <strong>of</strong> N 1 N 2 N t allows us to write<br />

1 2 =<br />

=<br />

t∏<br />

j=1<br />

We can then rewrite the system (9.2) as<br />

⎧<br />

⎨<br />

⎩<br />

[<br />

N j<br />

1 I j<br />

2<br />

]<br />

∣<br />

∣ = <br />

(<br />

e − 2 − 1 + e −1− 1) t<br />

2 10 1 + 1 − = 10<br />

2 1 + 1 − <br />

2 01 1 + 1 − = 01<br />

2 1 + 1 −

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!