IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i1p313-333.html
   My bibliography  Save this article

Risk Sharing with Lambda Value at Risk

Author

Listed:
  • Peng Liu

    (School of Mathematics, Statistics and Actuarial Science, University of Essex, Colchester CO4 3SQ, United Kingdom)

Abstract

In this paper, we study the risk-sharing problem among multiple agents using lambda value at risk ( Λ VaR ) as their preferences via the tool of inf-convolution, where Λ VaR is an extension of value at risk ( VaR ). We obtain explicit formulas of the inf-convolution of multiple Λ VaR with monotone Λ and explicit forms of the corresponding optimal allocations, extending the results of the inf-convolution of VaR . It turns out that the inf-convolution of several Λ VaR is still a Λ VaR under some mild condition. Moreover, we investigate the inf-convolution of one Λ VaR and a general monotone risk measure without cash additivity, including Λ VaR , expected utility, and rank-dependent expected utility as special cases. The expression of the inf-convolution and the explicit forms of the optimal allocation are derived, leading to some partial solution of the risk-sharing problem with multiple Λ VaR for general Λ functions. Finally, we discuss the risk-sharing problem with Λ VaR + , another definition of lambda value at risk. We focus on the inf-convolution of Λ VaR + and a risk measure that is consistent with the second-order stochastic dominance, deriving very different expression of the inf-convolution and the forms of the optimal allocations.

Suggested Citation

  • Peng Liu, 2025. "Risk Sharing with Lambda Value at Risk," Mathematics of Operations Research, INFORMS, vol. 50(1), pages 313-333, February.
  • Handle: RePEc:inm:ormoor:v:50:y:2025:i:1:p:313-333
    DOI: 10.1287/moor.2023.0246
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.0246
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2023.0246?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormoor:v:50:y:2025:i:1:p:313-333. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.