Intro to Credibility

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/24

flashcard set

Earn XP

Description and Tags

Section 1 of Exam MAS-II

Last updated 11:59 PM on 8/2/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

25 Terms

1
New cards

Collective Risk Model: Aggregate Premium Equation

knowt flashcard image
2
New cards

Aggregate premium mean and variance

knowt flashcard image
3
New cards

Full Classic (Limited Fluctuation) Credibility Condition

S bar = Sample mean

Miu_S = Expected mean

k = accuracy parameter

1 - alpha = Coverage Probability

<p>S bar = Sample mean</p><p>Miu_S = Expected mean</p><p>k = accuracy parameter</p><p>1 - alpha = Coverage Probability</p>
4
New cards

Convert between full credibility standard for n_e and n_c

knowt flashcard image
5
New cards

Full credibility formula table for PP, Freq, and Sev with n_c and n_e

knowt flashcard image
6
New cards

Updated prediction of loss for partial credibility

D = Observed

M = Manual Rate

Z = Credibility Factor

<p>D = Observed</p><p>M = Manual Rate</p><p>Z = Credibility Factor</p>
7
New cards

Square root rule for calculating Z

n = actual exposures

n * miu_N = avg claims for n exposures (use actual number of claims for sev or if miu_N is unknown)

<p>n = actual exposures</p><p>n * miu_N = avg claims for n exposures (use actual number of claims for sev or if miu_N is unknown)</p>
8
New cards

Model Distribution: Discrete vs Continuous

knowt flashcard image
9
New cards

Posterior Distribution: Discrete vs Continuous

Remember to check if a common distribution can be recognized from f(data | theta) * pi(theta) and the domain. Recognizing a distribution allows us to avoid integration and save time.

<p><span>Remember to check if a common distribution can be recognized from f(data | theta) * pi(theta) and the domain. Recognizing a distribution allows us to avoid integration and save time.</span></p>
10
New cards

Predictive Distribution: Discrete vs Continuous

knowt flashcard image
11
New cards

Loss Functions: 3 Types with 3 Bayesian Estimates

knowt flashcard image
12
New cards

Loss Function Formulas

knowt flashcard image
13
New cards

Conjugate Prior Types

Plus Uniform (0, theta) - SP-Pareto

<p>Plus Uniform (0, theta) - SP-Pareto</p>
14
New cards

Conjugate Prior: Poisson-Gamma

knowt flashcard image
15
New cards

Conjugate Prior: Poisson-Gamma (1/theta)

knowt flashcard image
16
New cards

Conjugate Prior: Exponential-Gamma

knowt flashcard image
17
New cards

Conjugate Prior: Exponential-Inverse Gamma

knowt flashcard image
18
New cards

Conjugate Prior: Binomial-Beta

knowt flashcard image
19
New cards

Conjugate Prior: Geometric-Beta

knowt flashcard image
20
New cards

Convert Geometric from mean-based (B) to probability-based (q)

knowt flashcard image
21
New cards

Steps to solving a Buhlmann credibility problem

knowt flashcard image
22
New cards

Uniform Exposures: Hypothetical mean, Process Variance mean, and Variance of Hypothetical Mean Equations

Miu_x is x bar

<p>Miu_x is x bar</p>
23
New cards

Non-Uniform Exposures: Hypothetical mean, Process Variance mean, and Variance of Hypothetical Mean Equations

knowt flashcard image
24
New cards

Credibility-Weighted Mean (EHM)

Also called method to “preserve total losses/claim count”

<p>Also called method to “preserve total losses/claim count”</p>
25
New cards

Best way to identify the number of exposures (n) for the Z equation

Think “what is the denominator for x bar” for whatever the question is asking about (could be a single policyholder)