Finding efficient recursions for risk aggregation by computer algebra

✍ Scribed by Stefan Gerhold; Richard Warnung

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 471 KB
• Volume: 223
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2008.01.025

✦ Synopsis

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D-finite functions.