Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The computation of Greeks with multilevel Monte Carlo (1102.1348v1)

Published 7 Feb 2011 in q-fin.CP

Abstract: We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes the use of naive algorithms impossible. These challenges can be addressed in three different ways: payoff smoothing using conditional expectations of the payoff before maturity; approximating the previous technique with path splitting for the final timestep; using of a hybrid combination of pathwise sensitivity and the Likelihood Ratio Method. We investigate the strengths and weaknesses of these alternatives in different multilevel Monte Carlo settings.

Summary

We haven't generated a summary for this paper yet.