In this article, we study two optimization problems. The first is finding the best L1-approximant of a given random vector on some affine subspaces subject to a measurability condition. The second is finding the optimal allocation of policy limits such that the expected retained loss is minimized. Explicit solutions of both problems are constructed by utilizing the notion of conditional comonotonicity.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 45 (2009) Issue (Month): 1 (August) Pages: 89-93 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF