Value-at-Risk Bounds with Variance Constraints
38 Pages Posted: 18 Oct 2013 Last revised: 10 Jul 2015
Date Written: March 29, 2015
Recent literature deals with bounds on the Value-at-Risk (VaR) of risky portfolios when only the marginal distributions of the components are known. In this paper we study Value-at-Risk bounds when the variance of the portfolio sum is also known, a situation that is of considerable interest in risk management.
We provide easy to calculate Value-at-Risk bounds with and without variance constraint and show that the improvement due to the variance constraint can be quite substantial. We discuss when the bounds are sharp (attainable) and point out the close connections between the study of VaR bounds and convex ordering of aggregate risk. This connection leads to the construction of a new practical algorithm, called Extended Rearrangement Algorithm (ERA), that allows to approximate sharp VaR bounds. We test the stability and the quality of the algorithm in several numerical examples.
We apply the results to the case of credit risk portfolio models and verify that adding the variance constraint gives rise to significantly tighter bounds in all situations of interest. However, model risk remains a concern and we criticize regulatory frameworks that allow financial institutions to use internal models for computing the portfolio VaR at high confidence levels (e.g., 99.5%) as the basis for setting capital requirements.
Keywords: Value-at-Risk, Convex order, Comonotonicity, Model risk, Rearrangement algorithm
JEL Classification: C00, G28
Suggested Citation: Suggested Citation