IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2511.00717.html
   My bibliography  Save this paper

Lambda Value-at-Risk under ambiguity and risk sharing

Author

Listed:
  • Peng Liu
  • Alexander Schied

Abstract

In this paper, we investigate the Lambda Value-at-Risk ($\Lambda$VaR) under ambiguity, where the ambiguity is represented by a family of probability measures. We establish that for increasing Lambda functions, the robust (i.e., worst-case) $\Lambda$VaR under such an ambiguity set is equivalent to $\Lambda$VaR computed with respect to a capacity, a novel extension in the literature. This framework unifies and extends both traditional $\Lambda$VaR and Choquet quantiles (Value-at-Risk under ambiguity). We analyze the fundamental properties of this extended risk measure and establish a novel equivalent representation for $\Lambda$VaR under capacities with monotone Lambda functions in terms of families of downsets. Moreover, explicit formulas are derived for robust $\Lambda$VaR when ambiguity sets are characterized by $\phi$-divergence and the likelihood ratio constraints, respectively. We further explore the applications in risk sharing among multiple agents. We demonstrate that the family of risk measures induced by families of downsets is closed under inf-convolution. In particular, we prove that the inf-convolution of $\Lambda$VaR with capacities and monotone Lambda functions is another$\Lambda$VaR under a capacity. The explicit forms of optimal allocations are also derived. Moreover, we obtain more explicit results for risk sharing under ambiguity sets characterized by $\phi$-divergence and likelihood ratio constraints. Finally, we explore comonotonic risk-sharing for $\Lambda$VaR under ambiguity.

Suggested Citation

  • Peng Liu & Alexander Schied, 2025. "Lambda Value-at-Risk under ambiguity and risk sharing," Papers 2511.00717, arXiv.org.
  • Handle: RePEc:arx:papers:2511.00717
    as

    Download full text from publisher

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

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2511.00717. 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.