arXiv subjects

Daniel Chee

Publications and source records attributed to Daniel Chee.

3 recordsLinked to original sources

arXiv2026

A Monotone Limit Approach to Entropy-Regularized American Options

Recent advances in continuous-time optimal stopping have been driven by entropy-regularized formulations of randomized stopping problems, with most existing approaches relying on partial differential equation methods. In this paper, we propose a fully probabilistic framework based on the Doob-Meyer-Mertens decomposition of the Snell envelope and its representation through reflected backward stochastic differential equations. We introduce an entropy-regularized penalization scheme yielding a monotone approximation of the value function and establish explicit convergence rates under suitable regularity assumptions. In addition, we develop a policy improvement algorithm based on linear backward stochastic differential equations and illustrate its performance through a simple numerical experiment for an American-style max call option

q-fin.CP↗

arXiv2026

Entropy-regularized penalization schemes and reflected BSDEs with singular generators

This paper extends our previous work to continuous-time optimal stopping, focusing on American options in an exploratory setting. Our first contribution is an entropy-regularized penalization scheme, inspired by classical penalization techniques for reflected BSDEs. It yields a smooth approximation of the stopping rule, promotes exploration, and enables gradient-based learning methods. We prove well-posedness, convergence, and illustrate numerical performance in low-dimensional examples. Our second contribution analyzes the behaviour of the scheme as the penalization parameter grows, showing that the limit solves a reflected BSDE with a logarithmically singular generator, for which we establish existence and uniqueness via a monotone limit argument.

q-fin.MF↗

arXiv2025

An Entropy Regularized BSDE Approach to Bermudan Options and Games

In this paper, we investigate optimal stopping problems in a continuous-time framework where only a discrete set of stopping dates is admissible, corresponding to the Bermudan option, within the so-called exploratory formulation. We introduce an associated control problem for the value function, represented as a non-c\`adl\`ag reflected backward stochastic differential equation (RBSDE) with an entropy regulariser that promotes exploration, and we establish existence and uniqueness results for this entropy-regularised RBSDE. We then compare the entropy-regularised RBSDE with the theoretical value of a Bermudan option and propose a reinforcement learning algorithm based on a policy improvement scheme, for which we prove both monotone improvement and convergence. This methodology is further extended to Bermudan game options, where we obtain analogous results. Finally, drawing on the preceding analysis, we present two numerical approximation schemes - a BSDE solver based on a temporal-difference scheme and neural networks and the policy improvement algorithm - to illustrate the feasibility and effectiveness of our approach.

math.PR↗