• Title of article

    Computing strategies for achieving acceptability: A Monte Carlo approach

  • Author/Authors

    Pal، نويسنده , , Soumik، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2007
  • Pages
    19
  • From page
    1587
  • To page
    1605
  • Abstract
    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˘ervonenkis dimension of a class of possible strategies.
  • Keywords
    Measures of risk , Portfolio optimization , VC dimension , Neyman–Pearson lemma , optimization algorithm
  • Journal title
    Stochastic Processes and their Applications
  • Serial Year
    2007
  • Journal title
    Stochastic Processes and their Applications
  • Record number

    1577928