THE DESIGN OF AN OPTIMAL RETROSPECTIVE RATING PLAN
Bibliographic record
Abstract
Abstract A retrospective rating plan, whose insurance premium depends upon an insured's actual loss during the policy period, is a special insurance agreement widely used in liability insurance. In this paper, the design of an optimal retrospective rating plan is analyzed from the perspective of the insured who seeks to minimize its risk exposure in the sense of convex order. In order to reduce the moral hazard, we assume that both the insured and the insurer are obligated to pay more for a larger realization of the loss. Under the further assumptions that the minimum premium is zero, the maximum premium is proportional to the expected indemnity, and the basic premium is the only free parameter in the formula for retrospective premium given by Meyers (2004) and that the basic premium is determined in such a way that the expected retrospective premium equates to the expected indemnity with a positive safety loading, we formally establish the relationship that the insured will suffer more risk for a larger loss conversion factor or a higher maximum premium. These findings suggest that the insured prefers an insurance policy with the expected value premium principle, which is a special retrospective premium principle with zero loss conversion factor. In addition, we show that any admissible retrospective rating plan is dominated by a stop-loss insurance policy. Finally, the optimal retention of a stop-loss insurance is derived numerically under the criterion of minimizing the risk-adjusted value of the insured's liability where the liability valuation is carried out using the cost-of-capital approach based on the conditional value at risk.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".