The Generalised value at risk admissable set: constraint consistency and portfolio outcomes
Roger Bowden
No 33502, Working Paper Series from Victoria University of Wellington, School of Economics and Finance
Abstract:
Generalised value at risk (GVaR) adds a conditional value at risk or censored mean lower bound to the standard value at risk and considers portfolio optimisation problems in the presence of both constraints. For normal distributions the censored mean is synonymous with the statistical hazard function, but this is not true for fat-tailed distributions. The latter turn out to imply much tighter bounds for the admissible portfolio set and indeed for the logistic, an upper bound for the portfolio variance that yields a simple portfolio choice rule. The choice theory in GVaR is in general not consistent with classic Von Neumann Morgenstern utility functions for money. A re-specification is suggested to make it so that gives a clearer picture of the economic role of the respective constraints. This can be used analytically to explore the choice of portfolio hedges.
Keywords: Admissible set; Censored mean; Conditional value at risk; Effective utility functions; Generalised value at risk; Hazard functions; Hedging; Portfolio choice; Value at risk (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:
Downloads: (external link)
https://ir.wgtn.ac.nz/handle/123456789/33502
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:vuw:vuwecf:33502
Access Statistics for this paper
More papers in Working Paper Series from Victoria University of Wellington, School of Economics and Finance Alice Fong, Administrator, School of Economics and Finance, Victoria Business School, Victoria University of Wellington, PO Box 600 Wellington, New Zealand. Contact information at EDIRC.
Bibliographic data for series maintained by Library Technology Services ().