Computing strategies for achieving acceptability: A Monte Carlo approach
We consider a trader who wants to direct his or her portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a Monte Carlo algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the functional form of a trading strategy for achieving acceptability. We also prove optimality of the capital obtained. Explicit theoretical evaluations of hedging strategies are extremely difficult, and we avoid the problem by resorting to such computational methods. The main idea is to utilize the finite Vapnik-C[breve]ervonenkis dimension of a class of possible strategies.
Year of publication: |
2007
|
---|---|
Authors: | Pal, Soumik |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 117.2007, 11, p. 1587-1605
|
Publisher: |
Elsevier |
Keywords: | Measures of risk VC dimension Portfolio optimization Neyman-Pearson lemma Optimization algorithm |
Saved in:
Saved in favorites
Similar items by person
-
On capital requirements and optimal strategies to achieve acceptability
Pal, Soumik, (2006)
-
On capital requirements and optimal strategies to achieve acceptability
Pal, Soumik, (2006)
-
The geometry of relative arbitrage
Pal, Soumik, (2014)
- More ...