Paper: arXiv 2610.01585

Authors: Shuoqing Deng, Xin Zhang

Abstract

We consider the distribution-constrained optimal stopping problem \(\sup_{τ\sim μ} \mathbb E[B^*_τ]\), where \(μ\) is a probability distribution on \(\mathbb R_+\), and \((B^*_t)\) denotes the running maximum of a standard Brownian motion. This problem was introduced in Beiglbock et al. (PTRF, 2018), where a monotonicity principle is used to establish the optimal stopping time as the hitting time of a specific boundary. In this paper, we characterize this boundary by a variational inequality. In the spirit of Cox et al. (PTRF, 2019), we provide a novel probabilistic representation for the variational inequality as a time-reversed optimal stopping problem. A key ingredient for proving the viscosity solution property and comparison principle is a quantitative estimate near the singular corner of the time-space domain, where the initial and boundary conditions are incompatible. We then prove the optimality of the resulting hitting time through a discrete-time Snell envelope construction and a stability argument for the associated stopping times.

Complexity vs Empirical Score

  • Math Complexity: 9.0/10
  • Empirical Rigor: 2.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: This paper presents a highly mathematical and theoretical approach to an optimal stopping problem, focusing on variational inequalities and probabilistic representations. While the mathematical framework is sophisticated and novel, there is no empirical validation or backtesting, which is typical for theoretical probability papers.

Research Flowchart

  flowchart TD
    A["Research Goal: Characterize Optimal Stopping Boundary for Distribution-Constrained Max Stopping"] --> B{"Key Methodology: Variational Inequality & Probabilistic Representation"};
    B --> C{"Inputs: Standard Brownian Motion (B*t), Distribution μ on R+"};
    C --> D["Computational Processes: Time-reversed Optimal Stopping, Viscosity Solution, Snell Envelope"];
    D --> E["Key Findings: Optimal Boundary Characterized by VI, Novel Probabilistic Representation, Optimality Proof via Snell Envelope"];

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper characterizes the optimal stopping boundary for the distribution‑constrained stopping problem as the solution of a variational inequality and provides a novel probabilistic representation of this inequality as a time‑reversed optimal stopping problem.

Source sentence
In this paper, we characterize this boundary by a variational inequality. In the spirit of Cox et al. (PTRF, 2019), we provide a novel probabilistic representation for the variational inequality as a time-reversed optimal stopping problem.

Assumes 6

  • The target distribution µ is a probability distribution on ℝ₊ and its survival function p(t)=µ((t,∞)) is continuous, non‑increasing with p(0)=1. data
    Source sentence
    We consider the distribution-constrained optimal stopping problem $\sup_{τ\sim μ} \mathbb E[B^*_τ]$, where $μ$ is a probability distribution on $\mathbb R_+$, and $(B^*_t)$ denotes the running maximum of a standard Brownian motion. Let p : [0, ∞) →[0, 1] be continuous and nonincreasing, with p(0) = 1.
  • The boundary function b(t) is smooth, strictly negative, upper‑semicontinuous and satisfies b(t)=b⁻(t) (no upward jumps). model
    Source sentence
    2.1.1 The PDE formulation In this formal derivation, we assume that b is smooth and strictly negative and that the law of Yt restricted to {τb > t} has a density u, namely P(τb > t, Yt ∈dx) = u(t, x) dx, for b(t) < x < 0. Suppose b : (0, ∞) →[−∞, 0] is upper semicontinuous and, for 0 < t ≤T, b(t) = b−(t).
  • The density u(t,x) of the law of Yₜ on the continuation region exists and satisfies the forward heat equation with Neumann condition at 0 and Dirichlet condition at the moving boundary. model
    Source sentence
    It follows that the density function u satisfies the forward equation  ut = 1 2uxx, b(t) < x < 0, ux(t, 0) = 0, u(t, b(t)) = 0, t > 0, u(0, ·) = δ0. (2.1) 3 For b(t) < x ≤0, define function F(t, x) := P(τb > t, Yt > x) = R 0 x u(t, y) dy; and for x ≤b(t) let F(t, x) = P(τb > t).
  • The initial and boundary conditions are incompatible at the origin (0,0), i.e., Y₀=0 while F(0,x)=1 for x<0 and F(t,0)=0 for t>0. other
    Source sentence
    (2.3) The initial and boundary conditions are incompatible at (0, 0) because Y0 = 0. This motivates the following variational inequality formulation of the classical free-boundary problem: max ( Ft −1 2Fxx, F −p(t) ) = 0, for all x < 0, t > 0, (2.4) with the initial and boundary conditions F(0, x) = 1, F(t, 0) = 0, for all x < 0, t > 0.
Show 2 more
  • Viscosity solutions are sought in the class of functions satisfying p(t)H(t,x) ≤ U(t,x) ≤ min{p(t),H(t,x)}. model
    Source sentence
    Motivated by the above lemma, we will restrict in the next section the admissible sub- and supersolu-tions U to satisfy p(t)H(t, x) ≤U(t, x) ≤min{p(t), H(t, x)}. In the comparison argument below, when we consider sub- and supersolutions u and v satisfying satisfy the above bounds, it will naturally imply that u(t, x) −v(t, x) ≤(1 −p(t))H(t, x) ≤1 −p(t) →0 (2.10) 5 as (t, x) →(0, 0).
  • The stopping time τ̂ defined by the constructed boundary satisfies P(τ̂>0)=1 (no atom at zero). model
    Source sentence
    Assume also P(τb > 0) = 1. Moreover, P(τb = t) = 0 for 0 < t ≤T, and P(τb > t) = lim x→−∞Gb(t, x) = Gb(t, b(t)).

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 5

  • The variational inequality (2.4) admits a unique viscosity solution, establishing well‑posedness of the free‑boundary problem. theoretical
    Source sentence
    First, we analyze the wellposedness of a vari-ational inequality which determines the boundary of the inverse first passage problem. 2.2 Wellposedness of the variational inequality In this section, we justify the existence and uniqueness of viscosity solution to the system (2.4)–(2.5).
  • The constructed boundary ˆb(t) is upper‑semicontinuous and yields a stopping time τ̂ whose law matches the target distribution µ (i.e., τ̂∼µ). theoretical
    Source sentence
    Let p : [0, ∞) →[0, 1] be continuous and nonincreasing, with p(0) = 1. Then P(τˆb > t) = p(t), t ≥0.
  • The hitting time τ̂ is optimal among all stopping times with law µ, i.e., for any ρ∼µ, E[M_ρ] ≤ E[M_{τ̂}]. theoretical
    Source sentence
    For every stopping time ρ ∈T µ, E[Mρ] ≤E[Mˆτ]. Consequently, sup ρ∈T µ E[Mρ] = E[Mˆτ], where the value +∞is allowed.
  • A discrete‑time Snell envelope construction together with a stability argument provides an alternative proof of optimality without requiring a moment assumption on µ. theoretical
    Source sentence
    We first work in discrete time and add a deterministic function of the stopping time to the reward. We verify optimality using the Snell envelope and then pass to continuous time through the stability of the associated stopping times.
  • Quantitative bounds near the singular corner (0,0) allow comparison of sub‑ and supersolutions without assigning a value at the origin. theoretical
    Source sentence
    A key ingredient for proving the viscosity solution property and comparison principle is a quantitative estimate near the singular corner of the time-space domain, where the initial and boundary conditions are incompatible. We address this issue by es-tablishing quantitative bounds that determine an admissible solution class and allow comparison without assigning a value at the origin (0, 0).

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 24 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.