The optimal reinsurance strategy with price-competition between two reinsurers
Bibliographic record
Abstract
We study optimal reinsurance in the framework of stochastic game theory, in which there is an insurer and two reinsurers. A Stackelberg model is established to analyze the non-cooperative relationship between the insurer and reinsurers, where the insurer is considered as the follower and the reinsurers are considered as the leaders. The insurer is a price taker who determines reinsurance demand in the reinsurance market, while the reinsurers can price the reinsurance treaties. Our contribution is to use a Nash game to describe the price-competition between two reinsurers. We assume that one of the reinsurers adopts the variance premium principle and the other adopts the expected value premium principle. The insurer and the reinsurers aim to maximize their respective mean-variance cost functions which lead to a time-inconsistency control problem. To overcome the time-inconsistency issue in the game, we formulate the optimization problem of each player as an embedded game and solve it via a corresponding extended Hamilton-Jacobi-Bellman equation. We find that the insurer will sign propositional and excess loss reinsurance strategies with reinsurer 1 and reinsurer 2, respectively. When the claim size follows exponential distribution, there exists a unique equilibrium reinsurance premium strategy. Our numerical analysis verifies the impact of claim size, risk aversion and interest rates of the insurer and reinsurers on equilibrium reinsurance strategy and premium strategy, which can help to understand competition in the reinsurance market
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.003 | 0.002 |
| 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".