Metraipolis › archive › dc_2c094a3e346d
Optimal robust comonotonic risk sharing under operational constraints — arXiv:2611.09452
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09452
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T23:01:43.089Z
- SHA-256 of the archived text
4bf1e48132f10c77b95d2ae9a4cbb076705c06a44659cc0dbddd693ad398479a- Stable URL of this page
https://metraipolis.com/documento/dc_2c094a3e346d
How to cite
Optimal robust comonotonic risk sharing under operational constraints — arXiv:2611.09452 — arXiv (en), https://arxiv.org/abs/2611.09452 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c094a3e346d (Metraipolis archive dc_2c094a3e346d, sha256 4bf1e48132f10c77b95d2ae9a4cbb076705c06a44659cc0dbddd693ad398479a)
BibTeX
@misc{dc2c094a3e346d,
title = {Optimal robust comonotonic risk sharing under operational constraints — arXiv:2611.09452},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09452},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c094a3e346d; sha256 4bf1e48132f10c77b95d2ae9a4cbb076705c06a44659cc0dbddd693ad398479a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09452. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Risk-sharing arrangements such as reinsurance programs and catastrophe pools must satisfy operational constraints, including capacity limits, attachment bands, retention rules and cession limits. Under distortion risk measures, the unconstrained optimum assigns each loss layer to the participant for whom that layer is least costly, but operational constraints break this layerwise rule, and there is no general method to compute the constrained optimum. We show that, for comonotonic allocations, the participants' distortion risk measures and the operational constraints are linear in the amount of each loss layer held by each participant, so the constrained risk-sharing problem on a discretized loss is a linear program that standard software can solve. Its dual gives supporting prices for the loss layers and the marginal value of relaxing each operational constraint. Where the set of binding constraints changes, the constrained optimal value can have a kink, and the smallest and largest optimal multipliers then give the one-sided effects of relaxing and tightening a constraint. To protect the allocation against disagreement between loss models, we also consider the robust version of the risk-sharing problem, that is, minimizing the worst-case total risk assessment over finitely many probability scenarios. This robust problem is again a linear program, and we quantify the cost of protection against model uncertainty from its optimal value. We illustrate the approach with a catastrophe reinsurance tower. Tema degli esploratori: economia dei servizi IA (elenco arXiv econ.TH, nuovi lavori del giorno). Categorie arXiv: Theoretical Economics (econ.TH). Pagina del lavoro: https://arxiv.org/abs/2611.09452 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:58:37.056Z dalla pagina https://arxiv.org/list/econ.TH/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).