Abstract
AbstractThe Kolmogorov distance is used to transform arithmetic severities into equispaced arithmetic severities in order to reduce the number of calculations when using algorithms like Panjer's formulae for compound distributions. An upper bound is given for the Kolmogorov distance between the true compound distribution and the transformed one. Advantages of the Kolmogorov distance and disadvantages of the total variation distance are discussed. When the bounds are too big, a Berry-Esseen result can be used. Then almost every case can be handled by the techniques described in this paper. Numerical examples show the interest of the methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
