English

Robust Hedging of path-dependent options using a min-max algorithm

Mathematical Finance 2025-11-04 v1 Optimization and Control Probability Risk Management

Abstract

We consider an investor who wants to hedge a path-dependent option with maturity TT using a static hedging portfolio using cash, the underlying, and vanilla put/call options on the same underlying with maturity t1 t_1, where 0<t1<T0 < t_1 < T. We propose a model-free approach to construct such a portfolio. The framework is inspired by the \textit{primal-dual} Martingale Optimal Transport (MOT) problem, which was pioneered by \cite{beiglbock2013model}. The optimization problem is to determine the portfolio composition that minimizes the expected worst-case hedging error at t1t_1 (that coincides with the maturity of the options that are used in the hedging portfolio). The worst-case scenario corresponds to the distribution that yields the worst possible hedging performance. This formulation leads to a \textit{min-max} problem. We provide a numerical scheme for solving this problem when a finite number of vanilla option prices are available. Numerical results on the hedging performance of this model-free approach when the option prices are generated using a \textit{Black-Scholes} and a \textit{Merton Jump diffusion} model are presented. We also provide theoretical bounds on the hedging error at TT, the maturity of the target option.

Keywords

Cite

@article{arxiv.2511.00781,
  title  = {Robust Hedging of path-dependent options using a min-max algorithm},
  author = {Purba Banerjee and Srikanth Iyer and Shashi Jain},
  journal= {arXiv preprint arXiv:2511.00781},
  year   = {2025}
}
R2 v1 2026-07-01T07:17:35.349Z