Double-Counting Problem of the Bonus-Malus System

10/23/2019
by   Rosy Oh, et al.
0

The bonus-malus system (BMS) is a widely used premium adjustment mechanism based on policyholder's claim history. Most auto insurance BMSs assume that policyholders in the same bonus-malus (BM) level share the same a posteriori risk adjustment. This system reflects the policyholder's claim history in a relatively simple manner. However, the typical system follows a single BM scale and is known to suffer from the double-counting problem: policyholders in the high-risk classes in terms of a priori characteristics are penalized too severely (Taylor, 1997; Pitrebois et al., 2003). Thus, Pitrebois et al. (2003) proposed a new system with multiple BM scales based on the a priori characteristics. While this multiple-scale BMS removes the double-counting problem, it loses the prime benefit of simplicity. Alternatively, we argue that the double-counting problem can be viewed as an inefficiency of the optimization process. Furthermore, we show that the double-counting problem can be resolved by fully optimizing the BMS setting, but retaining the traditional BMS format.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2020

Predictive Risk Analysis in Collective Risk Model: Choices between Historical Frequency and Aggregate Severity

Typical risk classification procedure in insurance is consists of a prio...
research
05/25/2019

Counting Homomorphisms Modulo a Prime Number

Counting problems in general and counting graph homomorphisms in particu...
research
12/11/2017

On Quadratic Penalties in Elastic Weight Consolidation

Elastic weight consolidation (EWC, Kirkpatrick et al, 2017) is a novel a...
research
09/13/2023

On correlation distribution of Niho-type decimation d=3(p^m-1)+1

The cross-correlation problem is a classic problem in sequence design. I...
research
05/10/2020

Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting

We consider the problem of finding a solution to a multivariate polynomi...
research
06/29/2018

High Dimensional Discrete Integration by Hashing and Optimization

Recently Ermon et al. (2013) pioneered an ingenuous way to practically c...
research
06/04/2019

Snackjack: A toy model of blackjack

Snackjack is a highly simplified version of blackjack that was proposed ...

Please sign up or login with your details

Forgot password? Click here to reset