Publication Cover
Stochastics
An International Journal of Probability and Stochastic Processes
Volume 94, 2022 - Issue 5
937
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Multi-dimensional sequential testing and detection

&
Pages 789-806 | Received 01 Sep 2020, Accepted 11 Oct 2021, Published online: 26 Oct 2021

Abstract

We study extensions to higher dimensions of the classical Bayesian sequential testing and detection problems for Brownian motion. In the main result, we show that, for a large class of problem formulations, the cost function is unilaterally concave. This concavity result is then used to deduce structural properties for the continuation and stopping regions in specific examples.

1. Introduction

In the classical paper [Citation19], two sequential problems of determining an unknown drift of a one-dimensional Wiener process were studied: (i) the sequential testing problem of determining a constant drift as quickly as possible, and (ii) the problem of quickest detection where one seeks to determine a change-point as quickly as possible. In the current article, we study multi-dimensional analogues of these problems.

To describe these problems, let Y=(Y1,,Yn) be an n-dimensional continuous-time Markov chain with state-space {0,1}n, and with a transition rate matrix Q=(λiλi00) for the ith component. Here, λi0, i=1,,n are given constants, and we assume a random starting point Y0 such that P(Y0i=1)=πi and P(Y0i=0)=1πi for πi[0,1]. Moreover, let X=(X1,,Xn) be a stochastic process given by Xti=μi0tYsids+Wti, where μi0 and W=(W1,,Wn) is an n-dimensional standard Brownian motion. Furthermore, we assume that Y1,,Yn,W1,,Wn are independent.

In [Citation19], the problem of sequential testing between two hypotheses and the problem of quickest detection of a drift change in the one-dimensional setting (n = 1) are solved (according to [Citation19], the solution of the hypotheses testing problem was already obtained in [Citation14] and proved optimal in the subclass consisting of so-called regular solutions; we have unfortunately been unable to locate the article [Citation14]). For constants a,b,c(0,), in the sequential testing problem one assumes λ:=λ1=0 and seeks a strategy (τ,d) to minimize (1) aP(d=0,Y01=1)+bP(d=1,Y01=0)+cE[τ](1) over FX-stopping times τ and FτX-measurable decisions d{0,1}. In the quickest detection problem one assumes λ>0, and one seeks τ to minimize (2) bP(Yτ1=0)+cE[0τYt1dt],(2) where the infimum is taken over FX-stopping times τ. Both these problems can be reduced to optimal stopping problems of the form (3) infτE[g(Πτ)+0τh(Πs)ds](3) written in terms of the conditional probability process Πt:=E[Yt1|Ft], where g and h are certain penalty function (for the sequential testing problem, g(π)=aπb(1π) and h(π)=c, whereas in the detection problem, g(π)=b(1π) and h(π)=cπ). In [Citation19], problems (Equation1) and (Equation2) are studied separately using a ‘guess and verify’ approach involving an associated free-boundary problem for the cost function.

The two examples above are the generic formulations in the one-dimensional case, and there is rich literature on various extensions. For example, testing and detection problems for a Poisson process with unknown intensity have been studied in [Citation16,Citation17], and a multi-source variant has been studied in [Citation3]. The references [Citation5,Citation6] treat some aspects of testing and detection problems with general distributions of the random drift; since the penalties for a wrong decision in [Citation5,Citation6] are binary, the sufficient statistic is one-dimensional, but time-inhomogeneous, Markov process. Formulations allowing for non-binary penalties appear in [Citation2,Citation15,Citation20], in which the natural sufficient statistic is two-dimensional and the analysis thus becomes more involved.

In the literature cited above, the observation process is one-dimensional; the existing literature on multi-dimensional versions is sparser. In [Citation8], a three-dimensional Brownian motion is observed for which exactly one coordinate has non-zero drift, and the problem of determining this coordinate as quickly as possible is studied. In the set-up of [Citation8], the three random drifts are heavily dependent; in fact, if one drift is non-zero, then the remaining two drifts have to be zero. In [Citation1], a less constrained set-up is used, in which two Poisson processes change intensity at two independent exponential times, and the problem of detecting the minimum of these two times is considered.

In the current article, we use a similar unconstrained set-up as in [Citation1] to study sequential testing and detection problems for a multi-dimensional Wiener process. The variety of possible versions of such testing and detection problems is very rich; indeed, in some applications it would be natural to seek to determine all drifts as accurately as possible, whereas it would be more natural in other applications to determine only one of all possible drifts. Similarly, in the quickest detection problem, some applications would suggest to look for the smallest change-point (as in [Citation1]), whereas one in other applications would try to detect the last change-point; further variants are listed below. In the formulations we suggest, coordinates are modelled independently, and the only interdependence is via the choice of a single stopping time at which the decision is made. Thus, the underlying theme of the problems under consideration is that the cost of monitoring does not scale linearly with the number of processes to observe.

Rather than studying all different formulations on a case by case basis, the multitude of multi-dimensional formulations motivates a unified treatment of the corresponding stopping problems. It turns out that a large class of such problems can be written in the form (Equation3) (or rather, a multi-dimensional version of (Equation3)), with g and h both unilaterally concave (concave in each variable separately). A key insight of the current article is that unilateral concavity of the cost function is a generic property for a unified study of structural properties in higher dimensions. In fact, we show that that unilateral concavity of the penalty functions is preserved in the sense that also the corresponding cost function is unilaterally concave (Theorem 3.6). Since many multi-dimensional penalty functions are unilaterally piecewise affine, the concavity property provides valuable information about the structure of the corresponding continuation and stopping regions.

There is related literature on the preservation of spatial concavity/convexity (and consequences for volatility misspecification) for martingale diffusions within the mathematical finance literature, see, for example, [Citation9,Citation11] for one-dimensional results. In higher dimensions, preservation of concavity is a rather rare property, compare [Citation7,Citation10]. With this in mind, we point out that preservation of unilateral concavity is a weaker property; however, it is of less financial importance, and has therefore been less studied in the financial literature. Also note that for the multi-dimensional version of (Equation3), the natural choices of g and h are typically not concave, but only unilaterally concave. We also remark that the authors of [Citation1] use a three-dimensional embedding of a detection problem in order to obtain concavity of the value function; for unilateral concavity, however, one may remain in the two-dimensional set-up of the problem.

The paper is organized as follows. In Section 2, we specify the multi-dimensional versions of the sequential testing and quickest detection problems, and we provide a list of natural examples. In Section 3, we provide a unilateral concavity result for the multi-dimensional problem, and in Sections 4 and 5, we use unilateral concavity to derive structural properties of continuation regions for specific examples.

2. The multi-dimensional set-up

Recall that we continuously observe an n-dimensional process X given by dXti=μiYtidt+dWti, where the drift is modelled using a continuous-time Markov chain Yi with state-space {0,1} and transition rate matrix Qi=(λiλi00). Moreover, the initial condition satisfies P(Y0i=1)=πi[0,1]. In parallel to the one-dimensional case, we introduce the multi-dimensional posterior probability process Π=(Π1,Πn) by Πti:=E[Yti|FtX]. By our independence assumption we note that Πti=E[Yti|FtXi], and, in particular, that the coordinates of Π are independent.

It is well-known from filtering theory (cf. [Citation13]) that the process Π is given explicitly by Πti=ji(t,{Xs,0st})1+ji(t,{Xs,0st}), where ji(t,{Xs,0st})=exp{μiXti(μi22λi)t}×(πi1πi+λi0texp{μiXsi+(μi22λi)s}ds). Moreover, it satisfies (4) dΠti=λi(1Πti)dt+μiΠti(1Πti)dW¯ti(4) for i=1,,n, where the innovation process W¯=(W¯1,,W¯n) defined by W¯ti=Xtiμi0tΠsids is an n-dimensional Brownian motion with independent coordinates. Consequently, Π is an n-dimensional time-homogeneous Markov process with independent coordinates; allowing for an arbitrary starting point π[0,1]n, we define a cost function V:[0,1]n[0,) by (5) V(π)=infτEπ[g(Πτ)+0τh(Πs)ds],(5) where g and h are given continuous functions. We also introduce the continuation region C:={π[0,1]n:V(π)<g(π)} and its complement, the stopping region D=[0,1]nC, and we recall from optimal stopping theory that the stopping time τ=inf{t0:ΠtD} is optimal in (Equation5).

In the next subsections, we list a few natural formulations of multi-dimensional sequential testing problems and multi-dimensional detection problems. All these examples can be written as stopping problems of the form (Equation5).

2.1. Sequential testing formulations

Assume that λi=0, i=1,,n and that the penalization in time is linear, i.e. of the type cE[τ] for some constant c>0. All formulations below can then be written on the form (Equation5) with h = c but with different penalty functions g. For simplicity, we consider symmetric penalization (corresponding to a = b = 1 in (Equation1)); generalizations to set-ups with non-symmetric weights are straightforward.

(ST1)

Consider the problem infτ,d{i=1nP(diY0i)+cE[τ]}, where the infimum is taken over FX-stopping times τ and decisions d{0,1}n such that d is FτX-measurable, i.e. the tester is penalized equally for every faulty decision. This problem can be written on the form (Equation5) with g(π)=i=1nπi(1πi).

(ST2)

Consider the problem infτ,d,d~{P(dY0d~)+cE[τ]}, where the infimum is taken over FX-stopping times τ and decisions d{0,1} and d~{1,,n} that are FτX-measurable. Thus the tester seeks to determine as quickly as possible a drift for only one of the processes. For this problem, the penalty function is given by g(π)=i=1n(πi(1πi)).

(ST3)

Let for simplicity n = 2 (generalizations are straightforward), let μ1=μ2=:μ and let γ[0,1] be a given constant. Consider the problem infτ1,τ2,d1,d2{P(d1Y01)+P(d2Y02)+cE[τ1τ2+(1γ)(τ1τ2τ1τ2)]}, where the infimum is taken over stopping times τ1, τ2 and decisions d1,d2{0,1} such that di is FτiX-measurable. Here, γ is a cost reduction parameter that describes how the cost (per unit of time) of observing two processes relates to the cost of observing only one process. Using the strong Markov property, this multiple stopping problem reduces to a problem of type (Equation5) with penalty g(π1,π2)=i=12(πi(1πi)+uμ,c(1γ)(π3i)), where uμ,c(1γ) is the value function of the one-dimensional sequential testing problem with cost c(1γ) per unit of time, see (Equation6) below.

2.2. Quickest detection formulations

Now assume that λi>0 for all i, and let c>0 be a constant. In all of the formulations below, the infimum is taken over FX-stopping times.

(QD1)

Consider the problem infτ{P(max1inYτi=0)+cE[0τmax1inYtidt]}. Here, one seeks to determine the first change-point (this problem formulation was treated in [Citation1] for a detection problem involving two Poisson processes); the problem can be written on the form (Equation5) with g(π)=Πi=1n(1πi) and h(π)=c(1Πi=1n(1πi)).

(QD2)

A problem of determining the last change-point is obtained by instead considering infτ{P(min1inYτi=0)+cE[0τmin1inYtidt]}. Again, this problem can be written on the form (Equation5); the corresponding functions g and h are given by g(π)=1Πi=1nπi and h(π)=cΠi=1nπi, respectively.

(QD3)

Assume that a tester wants to detect one coordinate for which the change-point has happened. One possible formulation of this is infτ,d~{P(Yτd~=0)+cE[0τi=1nYtidt]}, where the infimum is taken also over FτX-measurable decisions d~{1,,n}. The problem can be written on the form (Equation5) where the corresponding functions g and h are given by g(π)=i=1n(1πi) and h(π)=ci=1nπi.

2.3. The one-dimensional case

To introduce notation, we end this section with a short review of the one-dimensional problems.

2.3.1. Sequential testing

In the case n = 1 and λ=0, let (6) u(π):=uμ,c(π):=infτEπ[Πτ(1Πτ)+cτ].(6) The notation uμ,c is used when we want to emphasize the dependence on the drift μ and the cost of observation parameter c, and we refer to this one-dimensional testing problem as ST(μ,c). We then know that u:[0,1][0,1] is concave with u(π)π(1π). Moreover, C:={π[0,1]:u(π)<π(1π)}=(A,1A) for some A(0,1/2); further details on u and A can be found in [Citation18].

2.3.2. Quickest detection

Assuming that n = 1 and λ>0, let u(π):=uμ,λ,c(π):=infτEπ[1Πτ+c0τΠtdt], where the notation uμ,λ,c is used when we want to emphasize the dependence on the parameters μ, λ and c, and we refer to this one-dimensional detection problem as QD(μ,λ,c). The function u:[0,1][0,1] is then concave and non-increasing. Moreover, C:={π[0,1]:u(π)<1π}=[0,B) for some B(0,1); again, further details on u and B can be found in [Citation18].

3. Properties of the cost function

In this section, we derive Lipschitz continuity and the unilateral concavity for the multi-dimensional stopping problem (Equation5). Throughout the remainder of this article, we make the following assumption.

Assumption 3.1

We assume that

  • the functions g,h:[0,1]n[0,) are Lipschitz continuous;

  • the functions g(π) and h(π) are concave in each variable πi separately;

  • if λi=0 for some i=1,,n, then h is constant.

Remark 3.2

Note that all examples (ST1)–(ST3) and (QD1)–(QD3) are covered by Assumption 3.1. Also note that the assumption of unilateral concavity is strictly weaker than (joint) concavity. In fact, g and h are not concave in (QD1)–(QD2).

3.1. Continuity

Theorem 3.3

The cost function V:[0,1]n[0,) is Lipschitz continuous.

Proof.

It suffices to check that V is Lipschitz in each variable πi separately. To do that, let i = 1 and denote by Πt the solution of (Equation4) with initial condition Πt=π[0,1]n, and denote by Π~t the solution with initial condition π~=(π~1,,π~n), where πj=π~j, j=2,,n and π1<π~1. By a comparison result for one-dimensional stochastic differential equations, Πt1Π~t1 for all t0. Moreover, d(Π~t1Πt1)=λ1(Π~t1Πt1)dt+dMt where M is a continuous martingale, so Π~t1Πt1 is a bounded supermartingale. Consequently, by optional sampling, 0E[Π~τ1Πτ1]π~1π1 for any stopping time τ. Thus |E[g(Π~τ)g(Πτ)]|CE[|Π~τΠτ|]C|π~1π1| where C is a Lipschitz constant of g. This shows that if h is constant, then V is Lipschitz in its first argument, and thus it is Lipschitz also in π.

Furthermore, if λ1>0, then E[Π~t1Πt1]=π~1π1λ10tE[Π~s1Πs1]ds, so E[Π~t1Πt1]=(π~1π1)eλ1t. Consequently, E[0τ|h(Π~t)h(Πt)|dt]D0E[|Π~tΠt|]dt=Dλ1(π~1π1), where D is a Lipschitz constant of h. It follows that |E[g(Π~τ)+0τh(Π~t)dt]E[g(Πτ)+0τh(Πt)dt]|(C+Dλ1)(π~1π1) for any stopping time τ. Therefore, V(π1,,πn) is Lipschitz in its first argument. Consequently, if λi>0 for all i=1,,n, then V is Lipschitz also in π.

Remark 3.4

It follows from the proof above that if λi=0 for i=1,,n, g is Lipschitz 1 in each variable separately and h is constant, then also V is Lipschitz 1 in each variable separately.

3.2. Unilateral concavity

Next, we study the unilateral concavity of the value function. Our proof is an adaption of an argument for concavity in [Citation15] to the present setting. Due to the presence of a multi-dimensional observation process X, we only obtain the unilateral concavity (as opposed to joint concavity obtained in [Citation15]). The line of proof is essentially one-dimensional, and independence of the coordinates of the Π-process is used.

Let P~ be a new measure defined so that dP~dP|FtX=exp{12i=1nμi20t(Πsi)2dsi=1n0tμiΠsidW¯si}, and denote by E~ the corresponding expectation operator. By the Girsanov theorem, Xt is an n-dimensional P~-Brownian motion. Define the probability likelihood process Φ=(Φ1,,Φn) by Φti=Πti1Πti and observe that Φ0i=πi1πi=:ϕi. Also note that an application of Ito's formula yields (7) dΦti=λi(1+Φti)dt+μiΦtidXti.(7) In the following result, we establish that the Radon–Nikodym derivative can be expressed in terms of the process Φ (this was noted in [Citation12] in a one-dimensional setting).

Proposition 3.5

We have V(π)i=1n(1πi)=infτE~[eλτ(i=1n(1+Φτi))g(Πτ)+0τeλt(i=1n(1+Φti))h(Πt)dt], where λ=i=1nλi.

Proof.

Define a process Yt by Yt=eλti=1n1πi1Πti=eλti=1n(1+Φti)(1πi) and observe that Y0=1. Using Ito's formula and (Equation4), we find that dYt=λYtdt+Yti=1n11ΠtidΠti+Yti=1n1(1Πti)2(dΠti)2=λYtdt+Yti=1n(λidt+μiΠtidW¯ti)+Yti=1nμi2(Πti)2dt=Yti=1nμiΠtidXti. Since dPdP~|FtX=exp{12i=1nμi20t(Πsi)2dsi=1n0tμiΠsidXsi}, it follows that dPdP~|FtX=Yt, so we can rewrite the value function as V(π)i=1n(1πi)=1i=1n(1πi)infτEπ[g(Πτ)+0τh(Πt)dt]=1i=1n(1πi)infτE~π[Yτ(g(Πτ)+0τh(Πt)dt)]=infτE~π[eλτi=1n(1+Φτi)g(Πτ)+eλτi=1n(1+Φτi)0τh(Πt)dt]=infτE~π[eλτi=1n(1+Φτi)g(Πτ)+0τeλti=1n(1+Φti)h(Πt)dt], which completes the proof.

Theorem 3.6

The function πiV(π) is concave in each variable separately (i.e. πiV(π) is concave for each i=1,,n).

Proof.

It suffices to check that π1V(π) is concave. To do that, first note that since (Equation7) is a linear equation, it can be solved explicitly as (8) Φti=e(λiμi22)t+μiXti(ϕi+λi0te(λiμi22)sμiXsids).(8) Thus Φti is affine in ϕi and independent of ϕj, ji. Moreover, denoting Zt=e(λ1μ122)t+μ1Xt1, we have that Φt1π1=Zt(1π1)2 and 2Φt1π12=2Zt(1π1)3 so that (9) 2Φt1π1=(1π)2Φt1π12.(9) Fix an FX-stopping time τ; we next claim that (10) G(π,ω):=(1π1)(1+Φτ1)g(Πτ)(10) is concave in π1. To see this, assume that g is C2 (the general case follows by approximation). Then Gπ1π1=2π1((1+Φτ1)g(Πτ))+(1π1)π1π1((1+Φτ1)g(Πτ))=2Φτ1π1(g+gπ11+Φτ1)+(1π1)(2Φτ1π12(g+gπ11+Φτ1)+(Φτ1π1)2gπ1π1(1+Φτ1)3)=(1Πτ11π1)3Zτ2gπ1π1 by (Equation9), so G in (Equation10) is concave in π1. Taking expectation we have that π1i=1n(1πi)E~[(eλτi=1n(1+Φτi)g(Πτ))] is concave in π1. By similar arguments, π10τeλt(i=1n(1+Φti))h(Πti)dt is concave, so i=1n(1πi)E~[(eλτi=1n(1+Φτi)g(Πτ))+0τeλt(i=1n(1+Φti))h(Πti)dt] is concave in π1 for each stopping time τ. Taking infimum over stopping times τ, it follows that π1V(π) concave, which completes the proof.

Remark 3.7

Consider the setting of (ST2) with n = 2, where g(π)=π1(1π1)π2(1π2). If a finite time horizon T is imposed, then the time derivative of the cost function V(t,π) for t close to T along the line segment {(π1,π2):π1=π2[0,1/2)} is proportional to π12(1π1)2, which is not convex. This indicates that V(π,t) is non-concave along π1=π2 for t close to T. Thus joint concavity is not to expect (even when g and h are concave).

4. Sequential testing problems

In this section, we use the general results of Section 3 to provide structural results for the multi-dimensional sequential testing problems (ST1)–(ST3). For the sake of graphical illustrations, we present the results for the case n = 2; the higher-dimensional version works similarly, and our results easily carry over to that case.

Remark 4.1

In the structural studies of (ST1)–(ST3) and (QD1)–(QD3) below, we focus on what conclusions can be drawn from our main result on unilateral concavity. Refined studies would aim at further properties of the stopping boundaries that we find. For example, a lower bound on the continuation region is provided by the set {Lg+h<0}, where L is the infinitesimal generator of Π, methods to prove that wedges of g are automatically contained in the continuation region can be obtained, and studies of continuity of stopping boundaries can be performed along the lines of [Citation4].

4.1. (ST1)

In this section, we provide further details for the problem (ST1) of determining all (i.e. both) drifts. Thus we consider the stopping problem V(π)=infτEπ[g(Πτ)+cτ], where g(π)=π1(1π1)+π2(1π2). Denote by R1=[0,1/2]×[0,1/2] so that g=π1+π2 on R1. Let (Ai,1Ai) be the continuation region for the one-dimensional problem ST(μi,c), i = 1, 2.

Proposition 4.2

There exists a non-increasing upper semi-continuous function b:[0,A1][0,A2] such that DR1={πR1:π1A1,π2b(π1)}.

Proof.

First note that V(π1,0)=uμ1,c(π1), so (π1,0)C precisely if π1(A1,1A1). Since V is Lipschitz continuous with parameter 1 in each direction by Remark 3.4, and since g has slope 1 in the π2-direction for π21/2, it follows that DR1={πR1:π1A1,π2b(π1)} for some b:[0,A1][0,1/2]. By a similar argument, starting from (0,π2) instead, it follows that bA2 and that b is non-increasing. Finally, the continuity of V implies that C is open, and b is thus upper semi-continuous.

By symmetry, the part of the continuation region within each square R2:=[1/2,1]×[0,1/2], R3:=[1/2,1]×[1/2,1] and R4:=[0,1/2]×[0,1/2] can be described similarly as in Proposition 4.2. For a graphical illustration, see Figure (a); all pictures have been produced using a standard finite difference scheme and an approximation of the value function using a finite, but large, fixed horizon.

Figure 1. Continuation regions (light) in (ST1) on the left and in (ST2) on the right. The parameters are μ1=μ2=1 and c = 0.2.

Figure 1. Continuation regions (light) in (ST1) on the left and in (ST2) on the right. The parameters are μ1=μ2=1 and c = 0.2.

4.2. (ST2)

Next, we provide further details for the problem (ST2) in the case n = 2. Thus we consider the stopping problem V(π)=infτEπ[g(Πτ)+cτ], where g(π)=π1(1π1)π2(1π2). Consider the triangular region T:={π2π1(1π1)}, and note that g=π2 in this region.

Proposition 4.3

There exists an upper semi-continuous function b:[0,1][0,1] with b(π1)π1(1π1) such that DT={πT:π2b(π1)}. Furthermore, b is non-decreasing on [0,1/2] and satisfies b(π1)=b(1π1).

Proof.

Since V(π1,0)=0=g(π1,0), we clearly have that (π1,0) is in the stopping region. Now, since V is Lipschitz(1) in each direction by Remark 3.4, and since g has slope 1 in the π2-direction, the existence of b follows.

The monotonicity property is a consequence of symmetry and concavity: if (π1,π2)TD then also (1π1,π2)TD, so unilateral concavity yields that the whole line segment {(p,π2);π1p1π1} belongs to the stopping region. Finally, the asserted upper semi-continuity of b follows from the continuity of V.

Let (Ai,1Ai) be the continuation region of ST(μi,c), i = 1, 2.

Proposition 4.4

The rectangle R:=(A1,1A1)×(A2,1A2) is contained in the continuation region.

Proof.

Take πR, and let i{1,2} be such that g(π)=πi(1πi). Define τi:=inf{t0:Πti(Ai,1Ai)} to be the optimal stopping time in the one-dimensional problem of determining Yi. Then V(π)Eπ[g(Πτi)+cτi]Eπ[Πτii(1Πτii)+cτi]=uμi,c(πi)<πi(1πi)=g(π), which shows that πC.

For a graphical illustration of the continuation region in (ST2), see Figure (b).

4.3. (ST3)

We now study the sequential testing problem (ST3) with cost reduction given by γ(0,1) (we exclude the cases γ{0,1} since they correspond to (ST1) and (ST2), respectively). The value function of this problem is V(π)=infτEπ[g(Πτ1,Πτ2)+cτ], where g(π1,π2):=(π1(1π1)+u(π2))(u(π1)+π2(1π2)) and u=uμ,c(1γ) is the value function of the one-dimensional problem ST(μ,c(1γ)). Since u is concave and Lipschitz(1), the value function V is also concave and Lipschitz(1) in each variable. Denote by T:={π[0,1]2:0π2π1(1π1)}, and note that g(π1,π2)=u(π1)+π2 on T.

Proposition 4.5

There exists an upper semi-continuous function b:[0,1][0,1/2] with b(π1)π1(1π1) such that DT={πT:π2b(π1)}. Moreover, b(π1)=b(1π1).

Proof.

We first claim that [0,1]×{0}D. To see this, note that g(π1,0)=u(π1) and that u(Πt1)+ct is a submartingale. It follows that V(π1,0)=u(π1).

Next, the fact that g is affine in π2 on T together with the unilateral concavity of V give the existence of b. The upper semi-continuity of b follows from continuity of V, and the symmetry of b follows from the symmetric set-up.

For a graphical illustration of Proposition 4.5, see Figure .

Figure 2. Continuation regions (light) in (ST3) for different values of the cost reduction parameter γ. The parameters are μ1=μ2=1 and c = 0.2; the cost reduction parameter is γ=0.2, γ=0.5 and γ=0.8, respectively.

Figure 2. Continuation regions (light) in (ST3) for different values of the cost reduction parameter γ. The parameters are μ1=μ2=1 and c = 0.2; the cost reduction parameter is γ=0.2, γ=0.5 and γ=0.8, respectively.

Remark 4.6

A few estimates on the stopping/continuation regions in (ST3) are readily obtained. Let (Aμ,c,1Aμ,c) be the continuation region in ST(μ,c).

If 12γ<1, then uμ,(1γ)c(π1)+uμ,(1γ)c(π2)Vg. Consequently, the continuation region is contained in the square (Aμ,(1γ)c,1Aμ,(1γ)c)2.

If 0<γ12, then uμ,c/2(π1)+uμ,c/2(π2)Vuμ,(1γ)c(π1)+uμ,(1γ)c(π2). Thus (Aμ,(1γ)c,1Aμ,(1γ)c)2C{π:π1orπ2(Aμ,c/2,1Aμ,c/2)}. In particular, if γ=1/2, then V(π)=uμ,c/2(π1)+uμ,c/2(π2) and C=(Aμ,c/2,1Aμ,c/2)2.

5. Quickest detection problems

In this section, we provide structural results for the multi-dimensional quickest detection problems (QD1)–(QD3). For the sake of graphical illustrations, we present the results for n = 2.

5.1. (QD1)

Consider the stopping problem V(π)=infτEπ[g(Πτ)+0τh(Πs)ds], where g(π)=(1π1)(1π2) and h(π)=c(1(1π1)(1π2)).

Proposition 5.1

There exists a non-increasing lower semi-continuous function b:[0,1][0,1] such that (11) C={π[0,1]2:π2<b(π1)}.(11)

Proof.

We first note that boundary points (π1,1) and (1,π2) are stopping points since V = g = 0 at such points. Consequently, by unilateral concavity it follows that if a point (π1,π2)C, then also [0,π1]×[0,π2]C. The existence of a non-increasing function b:[0,1][0,1] such that (Equation11) holds thus follows; the lower semi-continuity of b is a direct consequence of the continuity of V.

For a graphical illustration, see Figure (a).

Figure 3. Continuation regions (yellow) in (QD1) on the left, (QD2) in the middle and in (QD3) on the right. The parameters are μ1=μ2=1 and c = 1.

Figure 3. Continuation regions (yellow) in (QD1) on the left, (QD2) in the middle and in (QD3) on the right. The parameters are μ1=μ2=1 and c = 1.

5.2. (QD2)

We now study the stopping problem (Equation5) with g(π)=1π1π2 and h(π)=cπ1π2. Let [0,Bi) be the continuation region for the one dimensional problem QD(μi,λi,c), i = 1, 2.

Proposition 5.2

There exists a non-increasing lower semi-continuous function b:[B1,1][B2,1] such that C={π[0,1]2:π2<b(π1)}[0,B1)×[0,1].

Proof.

We first note that the line segment [B1,1]×{1} belongs to the stopping region and that g is affine in the π2-direction. Consequently, concavity yields the existence of a function b:[B1,1][0,1] so that C{π1B1}={π1B1,π2<b(π1}.

We now claim that {π2<B2}C. To see this, let H(π1,π2):=π1u2(π2)+1π1 where u2:=uμ2,λ2,c is the value function in QD(μ2,λ2,c). Then H = g if π2B2, and LH+cπ1π2=(1u2(π2))λ1(1π1)0 on [0,1]×[0,B2), where the inequality is strict provided π1<1. Now consider the stopping time τ2:=inf{t0:Πt2B2} which is optimal in QD(μ2,λ2,c). Then V(π1,π2)Eπ[g(Πτ21,Πτ22)+c0τ2Πt1Πt2dt]=E[H(Πτ21,Πτ22)+c0τ2Πt1Πt2dt]H(π1,π2) by supermartingality. Moreover, if π2<B2 and π1<1, then the second inequality is strict. Thus, if π2<B2 then V(π1,π2)H(π1,π2)1π1π2=g(π1,π2), where the first inequality is strict if π1<1, and the second inequality is strict if π1>0. Consequently, {π2<B2}C.

Using {π2<B2}C, it follows that bB2; interchanging π1 and π2 shows that {π1<B1}C and that b is non-increasing. Finally, the continuity of V implies lower semi-continuity of b.

The continuation region in (QD2) is illustrated in Figure (b).

5.3. (QD3)

Now assume that g(π)=1π1π2 and h(π)=c(π1+π2). By symmetry, it suffices to describe the structure of the continuation region in T:={π[0,1]2:π1π2}.

Proposition 5.3

There exists a function b:[0,1][0,1] with b(π1)π1 such that (12) CT={πT:π2<b(π1)}.(12) Moreover, b is lower semi-continuous and first non-increasing and then non-decreasing.

Proof.

We first note that g(π1,1)=0, so [0,1]×{1}D, and that g is affine in π2 on T; concavity thus implies the existence of b such that (Equation12) holds. Moreover, g is affine also in π1 on T, so horizontal sections of the stopping region inside T are intervals. Consequently, the function b is first non-increasing and then non-decreasing. Lower semi-continuity follows from the continuity of V.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported by Vetenskapsrådet [grant number 2019-03525].

References

  • E. Bayraktar, V. Poor, Quickest detection of a minimum of two Poisson disorder times, SIAM J. Control Optim. 46(1) (2007), pp. 308–331.
  • E. Bayraktar, S. Dayanik, and I. Karatzas, Adaptive Poisson disorder problem, Ann. Appl. Probab.16(3) (2006), pp. 1190–1261.
  • S. Dayanik, V. Poor, and S. Sezer, Multisource Bayesian sequential change detection, Ann. Appl. Probab. 18(2) (2008), pp. 552–590.
  • T. De Angelis, S. Federico, and G. Ferrari, Optimal boundary surface for irreversible investment with stochastic costs, Math. Oper. Res. 42(4) (2017), pp. 1135–1161.
  • E. Ekström and J. Vaicenavicius, Bayesian sequential testing of the drift of a Brownian motion, ESAIM Probab. Stat. 19 (2015), pp. 626–648.
  • E. Ekström and J. Vaicenavicius, Monotonicity and robustness in Wiener disorder detection, Seq. Anal. 38(1) (2019), pp. 57–68.
  • E. Ekström, S. Janson, and J. Tysk, Superreplication of options on several underlying assets, J. Appl. Probab. 42(1) (2005), pp. 27–38.
  • P.A. Ernst, G. Peskir, and Q. Zhou, Optimal real-time detection of a drifting Brownian motion, Ann. Appl. Probab. 30(3) (2020), pp. 1032–1065.
  • S. Janson and J. Tysk, Volatility time and properties of option prices, Ann. Appl. Probab. 13(3) (2003), pp. 890–913.
  • S. Janson and J. Tysk, Preservation of convexity of solutions to parabolic equations, J. Differ. Equ.206(1) (2004), pp. 182–226.
  • N. Jeanblanc-Picqué, M. El Karoui and S. Shreve, Robustness of the black and Scholes formula, Math. Finance 8(2) (1998), pp. 93–126.
  • M. Klein, Comment on ‘Investment timing under incomplete information’, Math. Oper. Res. 34(1) (2009), pp. 249–254.
  • R.S. Liptser, A.N. Shiryaev, Statistics of Random Processes. I, Springer, New York, 1977.
  • V.S. Mikhalevich, A Bayes test of two hypotheses concerning the mean of a normal process (in Ukrainian), Visnik. Kiiv. Univ. 1 (1958), pp. 101–104.
  • A.A. Muravlev and A.N. Shiryaev, Two sided disorder problem for a Brownian motion in a Bayesian setting, Proc. Steklov Inst. Math. 287(1) (2014), pp. 202–224.
  • G. Peskir and A. Shiryaev, Sequential testing problems for Poisson processes, Ann. Stat. 28(3) (2000), pp. 837–859.
  • G. Peskir and A. Shiryaev, Solving the Poisson disorder problem, in Advances in Finance and Stochastics, Springer, Berlin, 2002, pp. 295–312.
  • G. Peskir and A. Shiryaev, Optimal Stopping and Free-Boundary Problems, Lectures in Mathematics ETH Zürich, Birkhäuser Verlag, Basel, 2006.
  • A. Shiryaev, Two problems of sequential analysis, Cybernetics 2(3) (1967), pp. 63–69.
  • M. Zhitlukhin and A.N. Shiryaev, A Bayesian sequential testing problem of three hypotheses for Brownian motion, Stat. Risk Model. 28(3) (2011), pp. 227–249.