Optimal Risk Sharing for Law Invariant Monetary Utility Functions
AbstractWe consider the problem of optimal risk sharing of some given total risk between two economic agents characterized by law-invariant monetary utility functions or equivalently, law-invariant risk measures. We first prove existence of an optimal risk sharing allocation which is in addition increasing in terms of the total risk. We next provide an explicit characterization in the case where both agents' utility functions are comonotone. The general form of the optimal contracts turns out to be given by a sum of options (stop-loss contracts, in the language of insurance) on the total risk. In order to show the robustness of this type of contracts to more general utility functions, we introduce a new notion of strict risk aversion conditionally on lower tail events, which is typically satisfied by the semi-deviation and the entropic risk measures. Then, in the context of an AV@R-agent facing an agent with strict monotone preferences and exhibiting strict risk aversion conditional on lower tail events, we prove that optimal contracts again are European options on the total risk.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Working Papers with number halshs-00176606.
Date of creation: 2007
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00176606/en/
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Monetary utility functions; comonotonicity; Pareto optimal allocations;
Other versions of this item:
- E. Jouini & W. Schachermayer & N. Touzi, 2008. "Optimal Risk Sharing For Law Invariant Monetary Utility Functions," Mathematical Finance, Wiley Blackwell, vol. 18(2), pages 269-292.
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.