Choose your preferred view mode

Please select whether you prefer to view the MDPI pages with a view tailored for mobile displays or to view the MDPI
pages in the normal scrollable desktop version. This selection will be stored into your cookies and used automatically
in next visits. You can also change the view style at any point from the main header when using the pages with your
mobile device.

Abstract

Unlike delta-hedging or similar methods based on Greeks, global hedging is an approach that optimizes some terminal criterion that depends on the difference between the value of a derivative security and that of its hedging portfolio at maturity or exercise. Global hedging methods in discrete time can be implemented using dynamic programming. They provide optimal strategies at all rebalancing dates for all possible states of the world, and can easily accommodate transaction fees and other frictions. However, considering transaction fees in the dynamic programming model requires the inclusion of an additional state variable, which translates into a significant increase of the computational burden. In this short note, we show how a decomposition technique based on the concept of post-decision state variables can be used to reduce the complexity of the computations to the level of a problem without transaction fees. The latter complexity reduction allows for substantial gains in terms of computing time and should therefore contribute to increasing the applicability of global hedging schemes in practice where the timely execution of portfolio rebalancing trades is crucial.
View Full-Text

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).