IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2604.24546.html

Comonotonic improvement under feasibility constraints

Author

Listed:
  • Christopher Blier-Wong
  • Jean-Gabriel Lauzier

Abstract

Regulatory and contractual constraints on individual exposures are standard in insurance and reinsurance markets, but a poorly designed constraint can distort the economic incentives of risk-averse agents. In the unconstrained problem, the classical comonotonic improvement theorem guarantees Pareto-optimal allocations that are nondecreasing in the aggregate loss. A constraint that is not stable under risk reduction can destroy this property. We show by example that Value-at-Risk caps lead to optimal allocations that are non-comonotonic in the aggregate loss. We identify componentwise convex-order solidity as a sufficient condition on the feasible set that restores the comonotonic improvement under constraints. If replacing any agent's allocation by a less risky one preserves feasibility, then every feasible allocation admits a feasible comonotonic improvement for all convex-order-consistent preferences. This criterion covers many constraints typical in risk management, but excludes Value-at-Risk caps and idiosyncratic deductibles. We illustrate the implications of our main result in a mean-variance risk-sharing application.

Suggested Citation

  • Christopher Blier-Wong & Jean-Gabriel Lauzier, 2026. "Comonotonic improvement under feasibility constraints," Papers 2604.24546, arXiv.org.
  • Handle: RePEc:arx:papers:2604.24546
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2604.24546
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2604.24546. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.