Pith. sign in

REVIEW 1 cited by

Optimal Robust Reinsurance with Multiple Insurers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.11828 v5 pith:PPOYP2XZ submitted 2023-08-22 q-fin.RM

classification q-fin.RM
keywords insurersreinsurancereinsurercontractsexpectedambiguitymaximisemultiple
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study a reinsurer who faces multiple sources of model uncertainty. The reinsurer offers contracts to $n$ insurers whose claims follow compound Poisson processes representing both idiosyncratic and systemic sources of loss. As the reinsurer is uncertain about the insurers' claim severity distributions and frequencies, they design reinsurance contracts that maximise their expected wealth subject to an entropy penalty. Insurers meanwhile seek to maximise their expected utility without ambiguity. We solve this continuous-time Stackelberg game for general reinsurance contracts and find that the reinsurer prices under a distortion of the barycentre of the insurers' models. We apply our results to proportional reinsurance and excess-of-loss reinsurance contracts, and illustrate the solutions numerically. Furthermore, we solve the related problem where the reinsurer maximises, still under ambiguity, their expected utility and compare the solutions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Neural Operators Can Play Dynamic Stackelberg Games

    math.OC 2024-11 conditional novelty 6.0 of 10

    Attention-based neural operators can uniformly approximate the follower's best-response map in dynamic stochastic Stackelberg games on compact control sets, with approximate value guarantees.

Pith tools