Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/93679| Title: | Modeling loss reserving in non-life insurance |
| Authors: | Mallia, Stephanie (2010) |
| Keywords: | Linear models (Statistics) Life insurance Stochastic programming |
| Issue Date: | 2010 |
| Citation: | Mallia, S. (2010). Modeling loss reserving in non-life insurance (Bachelor's dissertation). |
| Abstract: | A non-life insurance company has to set aside the right amount of money in order to meet all future liabilities. Failing to do so, the company can become insolvent. One of the oldest actuarial techniques is the Chain-Ladder algorithm. It has been used widely to estimate loss reserving. However it excites controversy since it is not based on any theory until more recently researchers tried to justify it by some theoretical basis. This dissertation studies the approach of generalized linear models applied to loss reserving. In particular, it focuses on the Over-Dispersed Poisson model which reproduce the same reserve estimates as the Chain-Ladder technique. However such models are based on a few data and often assume independence between aggregated incremental claims which therefore do not capture the real dynamics of claim arrivals and payment processes. Then the model is formulated as a marked Poisson point process, the stochastic approach studies individual claims rather than aggregated. These processes are far more realistic since they are based on much weaker assumptions and explain better the dynamics of a non-life insurance portfolio. |
| Description: | B.SC.(HONS)STATS.&OP.RESEARCH |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/93679 |
| Appears in Collections: | Dissertations - FacSci - 1965-2014 Dissertations - FacSciSOR - 2000-2014 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BSC(HONS)STATISTICS_Mallia_Stephanie_2010.PDF Restricted Access | 4.18 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
