Stopping Levels for a Spectrally Negative Markov Additive Process

Abstract

The optimal stopping problem for pricing Russian options in finance requires taking the supremum of the discounted reward function over all finite stopping times. We assume the logarithm of the asset price is a spectrally negative Markov additive process with finitely many regimes. The reward function is given by the exponential of the running supremum of the price process. Previous work on Russian optimal stopping problem suggests that the optimal stopping time would be an upcrossing time of the drawdown at a certain level for each regime. We derive explicit formulas for identifying the stopping levels and computing the corresponding value functions through a recursive algorithm. A numerical is provided for finding these stopping levels and their value functions.