Quickest detection of a hidden target and extremal surfaces

Abstract

Let Z=(Zt)t0 be a regular diffusion process started at 0, let be an independent random variable with a strictly increasing and continuous distribution function F, and let τ=∈f\t0 Zt=\ be the first entry time of Z at the level . We show that the quickest detection problem \[∈fτ[P(τ<τ)+cE(τ -τ)+]\] is equivalent to the (three-dimensional) optimal stopping problem \[τE[Rτ-∫ 0τc(Rt)\,dt],\] where R=S-I is the range process of X=2F(Z)-1 (i.e., the difference between the running maximum and the running minimum of X ) and c(r)=cr with c>0. Solving the latter problem we find that the following stopping time is optimal: \[τ*=∈f \t0 f*(It,St) Xt g*(It,St)\,\] where the surfaces f* and g* can be characterised as extremal solutions to a couple of first-order nonlinear PDEs expressed in terms of the infinitesimal characteristics of X and c. This is done by extending the arguments associated with the maximality principle [Ann. Probab. 26 (1998) 1614-1640] to the three-dimensional setting of the present problem and disclosing the general structure of the solution that is valid in all particular cases. The key arguments developed in the proof should be applicable in similar multi-dimensional settings.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…