SearcharxivSearch

arXiv · 1505.07612

A quickest detection problem with an observation cost

Abstract

In the classical quickest detection problem, one must detect as quickly as possible when a Brownian motion without drift "changes" into a Brownian motion with positive drift. The change occurs at an unknown "disorder" time with exponential distribution. There is a penalty for declaring too early that the change has occurred, and a cost for late detection proportional to the time between occurrence of the change and the time when the change is declared. Here, we consider the case where there is also a cost for observing the process. This stochastic control problem can be formulated using either the notion of strong solution or of weak solution of the s.d.e. that defines the observation process. We show that the value function is the same in both cases, even though no optimal strategy exists in the strong formulation. We determine the optimal strategy in the weak formulation and show, using a form of the "principle of smooth fit" and under natural hypotheses on the parameters of the problem, that the optimal strategy takes the form of a two-threshold policy: observe only when the posterior probability that the change has already occurred, given the observations, is larger than a threshold $A\geq0$, and declare that the disorder time has occurred when this posterior probability exceeds a threshold $B\geq A$. The constants $A$ and $B$ are determined explicitly from the parameters of the problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert C. Dalang, Albert N. Shiryaev. 2015-05-28. A quickest detection problem with an observation cost. https://doi.org/10.1214/14-aap1028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR