Convex order for path-dependent derivatives: A dynamic programming approach

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We explore the functional convex order for various classes of martingales: Brownian or Lévy driven diffusions with respect to their diffusion coefficient, stochastic integrals with respect to their integrand. Each result is bordered by counterexamples. Our approach combines the propagation of convexity results through (simulable) discrete time recursive dynamics relying on a backward dynamic programming principle and powerful functional limit theorems to transfer the results to continuous time models. In a second part, we extend this approach to optimal stopping theory, namely to the réduites of adapted functionals of (jump) martingale diffusions. Applications to various types of bounds for the pricing of pathwise dependent European and American options in local volatility models are detailed. Doing so, earlier results are retrieved in a unified way and new ones are proved. This systematic paradigm provides tractable numerical methods preserving functional convex order which may be crucial for applications, especially in Finance.

Cite

CITATION STYLE

APA

Pagès, G. (2016). Convex order for path-dependent derivatives: A dynamic programming approach. Lecture Notes in Mathematics, 2168, 33–96. https://doi.org/10.1007/978-3-319-44465-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free