mlsanityData to 7 Oct 2026

Solving optimal stopping problems with Deep Q-Learning

arXiv 2101.09682 ↗First posted 24 Jan 2021q-fin.PR stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

We propose a reinforcement learning (RL) approach to model optimal exercise strategies for option-type products. We pursue the RL avenue in order to learn the optimal action-value function of the underlying stopping problem. In addition to retrieving the optimal Q-function at any time step, one can also price the contract at inception. We first discuss the standard setting with one exercise right, and later extend this framework to the case of multiple stopping opportunities in the presence of constraints. We propose to approximate the Q-function with a deep neural network, which does not require the specification of basis functions as in the least-squares Monte Carlo framework and is scalable to higher dimensions. We derive a lower bound on the option price obtained from the trained neural network and an upper bound from the dual formulation of the stopping problem, which can also be expressed in terms of the Q-function. Our methodology is illustrated with examples covering the pricing of swing options.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 28 references that are in the map. First posted on arXiv 24 Jan 2021.

Builds on

6 of 28 references.

References · 6

  1. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  2. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  3. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  4. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
  5. 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 723
  6. 2019Deep Neural Network Framework Based on Backward Stochastic Differential Equations for Pricing and Hedging American Options in High Dimensionscited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.