The Gapeev-Shiryaev Conjecture
Philip A. Ernst, Goran Peskir

TL;DR
This paper proves the Gapeev-Shiryaev conjecture, showing that monotonic signal-to-noise ratios lead to monotonic optimal stopping boundaries in diffusion process problems, using novel stochastic and PDE methods.
Contribution
It provides the first rigorous proofs of the conjecture in both sequential testing and quickest detection settings with different SDE coefficient conditions.
Findings
Confirmed the conjecture in sequential testing with Lipschitz/Holder coefficients.
Proved the conjecture in quickest detection with analytic coefficients.
Established methods for solving related problems with monotone signal-to-noise ratios.
Abstract
The Gapeev-Shiryaev conjecture (originating in Gapeev and Shiryaev (2011) and Gapeev and Shiryaev (2013)) can be broadly stated as follows: Monotonicity of the signal-to-noise ratio implies monotonicity of the optimal stopping boundaries. The conjecture was originally formulated both within (i) sequential testing problems for diffusion processes (where one needs to decide which of the two drifts is being indirectly observed) and (ii) quickest detection problems for diffusion processes (where one needs to detect when the initial drift changes to a new drift). In this paper we present proofs of the Gapeev-Shiryaev conjecture both in (i) the sequential testing setting (under Lipschitz/Holder coefficients of the underlying SDEs) and (ii) the quickest detection setting (under analytic coefficients of the underlying SDEs). The method of proof in the sequential testing setting relies upon a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Mathematics and Applications
