Quickest detection of a hidden target and extremal surfaces
Goran Peskir

TL;DR
This paper transforms a quickest detection problem for a diffusion process into a three-dimensional optimal stopping problem involving the process's range, and characterizes the optimal stopping rule via extremal solutions to nonlinear PDEs.
Contribution
It extends the maximality principle to a three-dimensional setting, providing a novel characterization of the optimal stopping surfaces for the detection problem.
Findings
Optimal stopping time characterized by extremal solutions to PDEs
Reduction of detection problem to a three-dimensional optimal stopping problem
General structure of solutions applicable to similar multi-dimensional problems
Abstract
Let be a regular diffusion process started at , let be an independent random variable with a strictly increasing and continuous distribution function , and let be the first entry time of at the level . We show that the quickest detection problem \[\inf_{\tau}\bigl[\mathsf{P}(\tau<\tau_{\ell})+c\mathsf{E}(\tau -\tau_{\ell})^+\bigr]\] is equivalent to the (three-dimensional) optimal stopping problem \[\sup_{\tau}\mathsf{E}\biggl[R_{\tau}-\int _0^{\tau}c(R_t)\,dt\biggr],\] where is the range process of (i.e., the difference between the running maximum and the running minimum of ) and with . Solving the latter problem we find that the following stopping time is optimal: \[\tau_*=\inf \bigl\{t\ge0\vert f_*(I_t,S_t)\le X_t\le g_*(I_t,S_t)\bigr\},\] where the surfaces …
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.
