Optimal real-time detection of a drifting Brownian coordinate
Philip Ernst, Goran Peskir, Quan Zhou

TL;DR
This paper presents the first exact solution to a Bayesian real-time detection problem for a drifting coordinate in a three-dimensional Brownian motion, optimizing detection speed and accuracy.
Contribution
It provides a rigorous solution including non-monotone stopping boundaries for the first time in this context.
Findings
Exact Bayesian detection strategy derived
Optimal stopping boundaries characterized rigorously
First solution of its kind in the literature
Abstract
Consider the motion of a Brownian particle in three dimensions, whose two spatial coordinates are standard Brownian motions with zero drift, and the remaining (unknown) spatial coordinate is a standard Brownian motion with a non-zero drift. Given that the position of the Brownian particle is being observed in real time, the problem is to detect as soon as possible and with minimal probabilities of the wrong terminal decisions, which spatial coordinate has the non-zero drift. We solve this problem in the Bayesian formulation, under any prior probabilities of the non-zero drift being in any of the three spatial coordinates, when the passage of time is penalised linearly. Finding the exact solution to the problem in three dimensions, including a rigorous treatment of its non-monotone optimal stopping boundaries, is the main contribution of the present paper. To our knowledge this is the…
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
TopicsStochastic processes and financial applications · Advanced Bandit Algorithms Research · Distributed Sensor Networks and Detection Algorithms
Optimal Real-Time Detection of
a Drifting Brownian Coordinate
P. A. Ernst, G. Peskir & Q. Zhou
Consider the motion of a Brownian particle in three dimensions, whose two spatial coordinates are standard Brownian motions with zero drift, and the remaining (unknown) spatial coordinate is a standard Brownian motion with a non-zero drift. Given that the position of the Brownian particle is being observed in real time, the problem is to detect as soon as possible and with minimal probabilities of the wrong terminal decisions, which spatial coordinate has the non-zero drift. We solve this problem in the Bayesian formulation, under any prior probabilities of the non-zero drift being in any of the three spatial coordinates, when the passage of time is penalised linearly. Finding the exact solution to the problem in three dimensions, including a rigorous treatment of its non-monotone optimal stopping boundaries, is the main contribution of the present paper. To our knowledge this is the first time that such a problem has been solved in the literature.
††footnotetext: Mathematics Subject Classification 2010. Primary 60G40, 60J65, 60H30. Secondary 35J15, 45G10, 62C10.††footnotetext: Key words and phrases: Optimal detection, sequential testing, Brownian motion, optimal stopping, elliptic partial differential equation, free-boundary problem, non-monotone boundary, smooth fit, nonlinear Fredholm integral equation, the change-of-variable formula with local time on surfaces.
1 Introduction
Imagine the motion of a Brownian particle in three dimensions, whose two spatial coordinates are standard Brownian motions with zero drift, and the remaining (unknown) spatial coordinate is a standard Brownian motion with a non-zero drift. Given that the position of the Brownian particle is being observed in real time, the problem is to detect as soon as possible and with minimal probabilities of the wrong terminal decisions, which spatial coordinate has the non-zero drift. The purpose of the present paper is to derive the solution to this problem in the Bayesian formulation, under any prior probabilities of the non-zero drift being in any of the three spatial coordinates, when the passage of time is penalised linearly.
The loss to be minimised over sequential decision rules is expressed as the linear combination of the expected running time and the probabilities of the wrong terminal decisions. This problem formulation of sequential testing dates back to [26] and has been extensively studied to date (see [11] and the references therein). The linear combination represents the Lagrangian and once the optimisation problem has been solved in this form it will also lead to the solution of the constrained problem where upper bounds are imposed on the probabilities of the wrong terminal decisions. The central focus of the present paper is on the Lagrangian and the methods needed to solve the problem in this form. The constrained problem itself will not be considered in the present paper as this extension is somewhat lengthy and more routine.
Standard arguments show that the initial optimisation problem can be reduced to an optimal stopping problem for the posterior probability process of the non-zero drift being in the spatial coordinates given . A canonical example of in one dimension is Brownian motion having one among two constant drifts (see [14] and [22]). In this case is a one-dimensional Markov/diffusion process. This problem has also been solved in finite horizon (see [8]). Books [23, Section 4.2] and [18, Section 21] contain expositions of these results and provide further details and references. Signal-to-noise ratio in these problems (defined as the difference between the two drifts divided by the diffusion coefficient) is constant. Sequential testing problems for in one dimension where the signal-to-noise ratio is not constant were studied more recently in [9] and [11]. In these problems is no longer Markovian, however, the process is a two-dimensional Markov/diffusion process with the infinitesimal generator of parabolic type.
Another canonical example of in one dimension is Brownian motion having one among three or more constant drifts (see [24] for a discrete time analogue). This problem has been studied more recently in [25] (see also [4] for a Poisson process analogue). The Markov/diffusion process is two-dimensional and its infinitesimal generator is also of parabolic type.
Related sequential testing problems for in three or more dimensions when each coordinate process of can have a non-zero drift have been studied in [13] and [2]. These problems contain an element of optimal control as well in deciding which coordinate process should be observed at any given time. The former paper contains a review of other related papers (such as [19]) and the latter paper shows that the Markov/diffusion process is one-dimensional even if one admits infinitely many coordinate processes of in the problem formulation.
In contrast to all the sequential testing problems studied to date we will see below that the two-dimensional Markov/diffusion process in the sequential testing problem of the present paper has the infinitesimal generator of elliptic type. Moreover, we will also see that the optimal stopping boundaries are non-monotone as functions of the coordinate variables. This fact itself presents a formidable challenge as to our knowledge no rigorous treatment of non-monotone optimal stopping boundaries has been exposed in the probabilistic literature as yet. Finding the exact solution to the problem for in three dimensions, including a rigorous treatment of its non-monotone optimal stopping boundaries, is the main contribution of the present paper. To our knowledge this is the first time that such a problem has been solved in the literature.
2 Outline of the paper
The exposition of the material is organised as follows. In Section 3 we derive the optimal stopping problem for where is the posterior probability process of the non-zero drift being in the spatial coordinate given for . Due to clearly only two coordinates of matter and this is utilised by passing to the posterior probability ratio process process defined by for . The processes and stand in one-to-one correspondence and we study the optimal stopping problem in terms of throughout. The previous considerations take place under the probability measure where is the prior probability of the non-zero drift being in the spatial coordinate for . In Section 4 we show that a measure change from to simplifies the setting upon verifying that the posterior probability ratio process coincides (up to the initial point) with the likelihood ratio process of and given for . This provides an explicit link between the process and the observed process .
In Section 5 we show that the process solves a coupled system of linear stochastic differential equations (of the geometric Brownian motion type) driven by two independent Brownian motions. This enables us to conclude that is a Markov/diffusion process and derive a closed form expression for its infinitesimal generator which is a second-order partial differential equation of elliptic type. The optimal stopping problem for is Bolza formulated and in Section 6 we disclose its Lagrange and Mayer formulations (see [18, Section 6] for the terminology). The Lagrange formulation is expressed in terms of the local time of on three straight lines which makes the optimal stopping problem more intuitive.
The observed process is three-dimensional and in Section 7 we consider the same optimal stopping problem when is two-dimensional. In this case is a one-dimensional Markov/ diffusion process so that standard arguments enable us to solve the optimal stopping problem in a closed form. The reduction of dimension three to dimension two corresponds to either or becoming [math] which is a natural boundary point for both processes (cf. [7]). The one-dimensional results of Section 7 are used in Section 8 to derive existence of the optimal stopping set and derive basic properties of the value function. We show that the optimal stopping set consists of three convex sets separated by the three straight lines that support the local time of in the Lagrange formulation of the optimal stopping problem. Using symmetry arguments combined with the one-dimensional results of Section 7 we also derive the asymptotic behaviour of the optimal stopping boundaries at zero and infinity.
In Section 9 we derive a directional smooth fit between the value function and the loss function at the optimal stopping boundary. The proof of the smooth fit makes use of the asymptotic behaviour of the optimal stopping boundary at infinity to counter-balance the lack of the global smoothness of the underlying loss function in the optimal stopping problem. In Section 10 we show that the optimal stopping boundaries are non-monotone in either direction of the state space of and prove the existence of a ‘belly’ which determines their curvature/shape. These arguments rely on the general hint from [17, Remark 13] on establishing the absence of jumps of the optimal stopping boundaries and make use of Hopf’s boundary point lemma to derive a contradiction with the directional smooth fit.
In Section 11 we disclose the free-boundary problem which stands in one-to-one correspondence with the optimal stopping problem and establish the fact that the value function and the optimal stopping boundaries solve the free-boundary problem uniquely. In Section 12 we show that the optimal stopping boundaries can be characterised as the unique solution to a coupled system of nonlinear Fredholm integral equations. These equations can be used to find the optimal stopping boundaries numerically (using Picard iteration).
3 Formulation of the problem
In this section we formulate the sequential testing problem under consideration. The initial formulation of the problem will be revaluated under a change of measure in the next section.
1. We consider a Bayesian formulation of the problem where it is assumed that one observes a sample path of the three-dimensional Brownian motion , whose two coordinates and are standard Brownian motions with zero drift, and the remaining (uknown) coordinate is a standard Brownian motion having a non-zero drift with a probability for where and belong to . The problem is to detect which coordinate is drifting as soon as possible and with minimal probabilities of the wrong terminal decisions. This real-time detection problem belongs to the class of sequential testing problems as discussed in Section 1 above.
2. Standard arguments imply that the previous setting can be realised on a probability space with the probability measure decomposed as follows
[TABLE]
for satisfying where is the probability measure under which the observed process has the -th coordinate equal to a standard Brownian motion with drift , and the remaining two coordinates are standard Brownian motions with zero drift for , with the three coordinates being independent. This can be formally achieved by introducing an unobservable random variable taking values with probabilities in satisfying and being independent from three standard Brownian motions so that after starting at a point in solves the system of stochastic differential equations
[TABLE]
for . Due to stationary and independent increments of Brownian motion it is clear that the starting point of plays no role in the sequel so we will leave it unspecified.
3. Being based upon the continued observation of , the problem is to test sequentially the hypotheses , , with a minimal loss. For this, we are given a sequential decision rule , where is a stopping time of (i.e. a stopping time with respect to the natural filtration of for ), and is an -measurable random variable taking values in the set . After stopping the observation of at time , the terminal decision function takes value if and only if the hypothesis is to be accepted for . With a constant given and fixed, the problem then becomes to compute the risk function
[TABLE]
for with and find the optimal decision rule at which the infimum in (3.3) is attained. Note that in (3.3) is the expected waiting time until the terminal decision is made, and are probabilities of the wrong terminal decisions for . Clearly, each probability could be further decomposed into the sum of two probabilities and for and in , and each of the six resulting probabilities could have a different constant/weight placed in front of them, however, since the constrained problems are not considered in the present paper as explained in the introduction, we only focus on the canonical setting of a single constant/weight given in (3.3) above.
4. To tackle the sequential testing problem (3.3) we consider the posterior probability process of given that is defined by
[TABLE]
for and . Noting that for any decision rule we have
[TABLE]
where in the final equality we use that , it follows that
[TABLE]
where equality is attained at the decision rule with defined as follows
[TABLE]
This shows that the problem (3.3) is equivalent to the optimal stopping problem
[TABLE]
where the infimum is taken over all stopping times of , and the function is given by
[TABLE]
for with . For this reason we focus on solving the optimal stopping problem (3.8) in what follows.
4 Measure change
In this section we show that changing the probability measure for with to provides important simplifications of the setting which make the subsequent analysis more transparent. The change of measure argument is presented in Lemma 1 below. This is then followed by a reformulation of the optimal stopping problem (3.8) under the new probability measure in Proposition 2 below.
1. To connect the process in (3.8) to the observed process we consider the likelihood ratio process defined by
[TABLE]
where and denote the restrictions of and to for and . By the Girsanov theorem one finds that
[TABLE]
for and . A direct calculation indicated below shows that the posterior probability ratio process defined by
[TABLE]
can be expressed in terms of (and hence as well) as follows
[TABLE]
for where for . Recalling that and formally setting it is easily seen that (4.3) is equivalent to
[TABLE]
for and .
2. To derive (4.3)-(4.5) one may use a standard rule for the Radon-Nikodym derivatives based on (3.1) that gives
[TABLE]
where denotes the restriction of to for with and . It is then easily verified that (4.6)-(4.8) imply (4.3)-(4.5) as claimed.
3. Previous arguments suggest that changing the probability measure to appears to be of canonical interest in the optimal stopping problem (3.8). In the sequel we let denote the restriction of to where is a stopping time of .
Lemma 1. The following identity holds
[TABLE]
for all stopping times of and all with .
Proof. Using the same arguments as in (4.6) above we find that
[TABLE]
for any and as above. From (4.10) we see that (4.9) holds and the proof is complete.
4. We now show that the optimal stopping problem (3.8) admits a transparent reformulation under the probability measure in terms of the process defined in (4.3) above. Recall that starts at and this dependence on the initial point will be indicated by a superscript to replacing its coordinate superscript for when needed.
Proposition 2. The value function from (3.8) satisfies the identity
[TABLE]
where the value function is given by
[TABLE]
for with where
[TABLE]
for and the infimum in (4.12) is taken over all stopping times of .
Proof. For with given and fixed, it is enough to show that the following identity holds
[TABLE]
for all bounded stopping times of . For this, suppose that such a stopping time is given and fixed, and note by (4.5)-(4.9) that
[TABLE]
Setting for we see by (4.2) and (4.4) that is a continuous martingale under so that integration by parts gives
[TABLE]
where the final term defines a continuous martingale under for . By the optional sampling theorem we therefore get
[TABLE]
Inserting this back into (4.15) we obtain (4.14) as claimed and the proof is complete.
5. It is clear from (4.2) and (4.4) that is a strong Markov/diffusion process. We will formally verify this fact in the next section by deriving a coupled system of stochastic differential equations (driven by two independent Brownian motions) that solves. Denoting the probability law of under by (where we move [math] from the subscript to a superscript for notational reasons) we see that the optimal stopping problem (4.12) can be rewritten as follows
[TABLE]
for with \mathsf{P}_{\!\varphi_{1},\varphi_{2}}\big{(}(\varPhi_{0}^{1},\varPhi_{0}^{2})\!=\!(\varphi_{1},\varphi_{2})\big{)}=1 where the infimum in (4.18) is taken over all stopping times of . In this way we have reduced the initial sequential testing problem (3.3) to the optimal stopping problem (4.18) for the strong Markov/diffusion process . We will see in the next section that this optimal stopping problem is inherently/fully two-dimensional with the infinitesimal generator of being of elliptic type.
5 Elliptic PDE
In this section we derive a coupled system of stochastic differential equations (driven by two independent Brownian motions) that solves. From this system we derive a closed-form expression for the infinitesimal generator of that can be recognised as a partial differential equations of elliptic type. We also show that a diffeomorphic transformation of logarithmic type maps the process ( and its state space ) to a process ( and its state space ) whose coordinate processes and are independent Brownian motions with a non-zero and zero drift respectively.
1. From (4.2) and (4.4) we see that
[TABLE]
under for where and belong to . Hence by Itô’s formula we find that
[TABLE]
under with and in . This shows that and are two correlated geometric Brownian motions.
2. A well-known (and easily verifiable) fact states that if and are two correlated standard Brownian motions satisfying for with , then and are two independent standard Brownian motions. Applying this implication to and with it follows that
[TABLE]
are two independent standard Brownian motions. From (5.4) we see that
[TABLE]
3. Making use of (5.5) in (5.2)+(5.3) we obtain
[TABLE]
with and in . This is a coupled system of stochastic differential equations ( driven by two independent standard Brownian motions and ) that and solve (strongly) and this solution is pathwise unique (see e.g. [21, pp 128-131]). Moreover, the solution is both a strong Markov process (see e.g. [21, pp 158-163]) and a strong Feller process (see e.g. [21, pp 170-173]). Making use of (5.5) in (5.1) we see that
[TABLE]
under for where and belong to . Often we will write and for to indicate dependence of and on the initial points and in .
4. Knowing that solves the system (5.6)+(5.7) and making use of Itô’s calculus we find that the infinitesimal generator of is given by
[TABLE]
for and in (see e.g. (2.7) in [17]). A standard classification of partial differential equations shows that is of elliptic type (see e.g. (2.12) in [17]).
5. Defining a diffeomorphic transformation of to by
[TABLE]
for , and setting
[TABLE]
we see from (5.8) that
[TABLE]
under for with and . This establishes a one-to-one correspondence between the process in and the process in . Although the latter process may be viewed as a canonical building block which further clarifies the underlying setting, we will mainly study the optimal stopping problem (4.18) by means of the former process in the sequel.
6 Lagrange and Mayer formulations
The optimal stopping problem (4.18) is Bolza formulated. In this section we derive its Lagrange and Mayer reformulations which are helpful in the subsequent analysis of the problem.
1. We first consider the Lagrange reformulation of the optimal stopping problem (4.18). For this, note that the loss function from (4.13) that appears on the right-hand side of (4.18) is not smooth at the three straight lines
[TABLE]
ordered clockwise (see Figure 1 below). Note moreover that is linear off the three straight lines and given by
[TABLE]
where is a subset of the state space surrounded by and (from the right and above), is a subset of the state space surrounded by and (from below and the right), and is a subset of the state space surrounded by and (from the left and above).
Proposition 3. The value function from (4.18) can be expressed as
[TABLE]
for where is the local time of at for given by
[TABLE]
and the infimum in (6.5) is taken over all stopping times of .
Proof. It is evident from (6.4) that restricted to can be extended to a twice continuously differentiable function on . Then and is not smooth at while is not smooth at and . Since is the graph of a (linear) function of , and and are the graphs of (linear) functions of , we see that the change-of-variable formula with local time on surfaces [16, Theorem 2.1] is applicable to and composed with , where we note that for and for . Hence the formula is also applicable to composed with and this gives
[TABLE]
for and where the local times are defined in (6.6)-(6.8) above. Since and are continuous martingales under we see that the two integrals on the right-hand side of (6.9) are continuous martingales under as well. By the optional sampling theorem we therefore find from (6.9) that
[TABLE]
for all and all stopping times of . Inserting (6.10) into (4.18) we obtain (6.5) as claimed and the proof is complete.
The Lagrange reformulation (6.5) of the optimal stopping problem (4.18) reveals the underlying rationale for continuing vs stopping in a clearer manner. Indeed, recalling that the local time process strictly increases only when is at , and that is strictly larger than for small , we see from (6.5) that it should never be optimal to stop at and the incentive for stopping should increase the further away gets from for . We will see in Section 8 below that these informal conjectures can be formalised and this will give a proof of the fact that the three straight lines are contained in the continuation set of the optimal stopping problem (4.18).
2. We next consider the Mayer reformulation of the optimal stopping problem (4.18). For this, in addition to in (4.13) above, define
[TABLE]
and set for .
Proposition 4. The value function from (4.18) can be expressed as
[TABLE]
for where the infimum is taken over all stopping times of .
Proof. Recalling the closed-form expression for in (5.9) it is easily verified that
[TABLE]
for . By Itô’s formula we thus find using (5.6)+(5.7) above that
[TABLE]
for and where the two integrals on the right-hand side define continuous local martingales under . Making use of a localisation sequence of stopping times for these two local martingales if needed, and applying the optional sampling theorem, we find from (6.14) that
[TABLE]
for all and all (bounded) stopping times of . Inserting (6.15) into (4.18) we obtain (6.12) as claimed and the proof is complete.
7 Two dimensions
The observed process in the initial sequential testing problem (3.3) is three-dimensional. In this section we consider the analogue of (3.3) and the resulting optimal stopping problem (4.18) when is two-dimensional. The reduction of dimension three to dimension two corresponds to either or becoming [math] which is a natural boundary point for both processes (cf. [7]). This shows that is a one-dimensional Markov/diffusion process when is two-dimensional so that standard arguments enable us to solve the problem (4.18) in a closed form. The derived results for the one-dimensional optimal stopping problem (4.18) when is two-dimensional will be used in the subsequent analysis of the two-dimensional optimal stopping problem (4.18) when is three-dimensional.
1. Using the same arguments as above, it is easily seen that the sequential testing problem (3.3) when is two-dimensional reduces to the optimal stopping problem (4.18) with being formally equal to zero. Omitting the subscript from for simplicity, we thus see that the optimal stopping problem (4.18) reads
[TABLE]
for with where the infimum in (7.1) is taken over all stopping times of . From (5.1) and (5.2) we see that
[TABLE]
under for with in where is a standard Brown- ian motion. From (7.3) we see that the infinitesimal generator of is given by
[TABLE]
which also follows formally by setting in (5.9) above.
Recognising the loss function in (7.1) as for , standard arguments imply (see e.g. [18]) that should solve the free-boundary problem
[TABLE]
where are the optimal stopping/boundary points to be found and we have for as well (in addition to (7.6) above).
The general solution to the ordinary differential equation (7.5) is given by
[TABLE]
for where and are two undetermined real constants. Boundary conditions (7.6) and (7.7) then read as follows
[TABLE]
It is a matter of routine to verify that the system (7.9)-(7.12) has a unique solution given by
[TABLE]
where and are the unique solution to
[TABLE]
satisfying .
By symmetry we may conclude that so that (7.13) and (7.14) reduce to
[TABLE]
respectively. It follows from (7.8) and (7.15) that
[TABLE]
defines a candidate value function for the optimal stopping problem (7.1).
Applying the Itô-Tanaka formula (cf. [20, p. 223]) to composed with , which reduces to Itô’s formula due to smooth fit (7.7), and making use of the optional sampling theorem, it is easily verified that from (7.17) coincides with the value function from (7.1) and the optimal stopping time (at which the infimum in (7.1) is attained) is given by
[TABLE]
where is the unique solution to (7.16) on .
To avoid a possible confusion with subscripts we will set in the sequel. Thus is the unique solution to
[TABLE]
and the stopping time
[TABLE]
is optimal in (7.1) where we set . These facts will be used in the subsequent analysis of the optimal stopping problem (4.18) when is three-dimensional.
8 Properties of the optimal stopping boundaries
In this section we establish the existence of an optimal stopping time in (4.18) when the observed process is three-dimensional and derive basic properties of the optimal stopping boundaries. These results will be further refined in Section 10 below.
1. Looking at (4.18) we may conclude that the (candidate) continuation and stopping sets in this problem are respectively given by
[TABLE]
where is defined in (4.13) above. Recalling (5.8) we see that the expectation in (6.12) defines a continuous function of the initial point in for every (bounded) stopping time of given and fixed. Taking the infimum over all (bounded) stopping time of we can conclude that the value function is upper semicontinuous on . From (4.13) and (6.11) we see that the loss function is continuous and hence lower semicontinuous on . It follows therefore by [18, Corollary 2.9] that the first entry time of the process into the closed set defined by
[TABLE]
is optimal in (6.12), and hence in (4.18) as well, whenever for all . In the sequel we will establish this and other properties of by analysing the boundary of . We first turn to global properties of the value function itself.
Proposition 5. For the value function from (4.18) we have
[TABLE]
Proof. We first show that (8.4) is satisfied. Combining (5.8) with the concavity of the loss function from (4.13) we see that the expectation in (4.18) defines a concave function of the initial point in for every (bounded) stopping time of given and fixed. Taking the infimum over all (bounded) stopping time of we find that the value function itself is concave as claimed in (8.4) above.
We next show that (8.5) is satisfied. From the concavity of on the open set we can conclude that is continuous on . Recall that there are concave functions defined on a convex subset of and taking values in , such that the limit of may not exist when belonging to the interior of converges to a point at the boundary of as . However, if is closed then it is well known (and easily verified) that such a function must be lower semicontinuous. Applying this implication to and we can conclude that is lower semicontinuous on . At the same time we know that is upper semicontinuous (as established following (8.2) above) and hence we can conclude that is continuous as claimed in (8.5) above.
2. We show that the three straight lines defined in (6.1)-(6.3) above are contained in the continuation set . The proof of this fact uses the Lagrange reformulation (6.5) of the optimal stopping problem (4.18) combined with the fact that the local times in (6.5) have a square-root growth at the three straight lines while the integral in (6.5) grows linearly.
Proposition 6. The straight lines from (6.1)-(6.3) are contained in the continuation set of the optimal stopping problem (4.18).
Proof. We claim that
[TABLE]
for all with some and for where is the first exit time of from a bounded rectangle containing the given point in its interior. Indeed, this follows by a direct application of Lemma 15 in [17] when belongs to , while the same lemma is applicable to obtained by a (bijective) clockwise rotation of for when belongs to . Note that the case when presents no difficulty as the proof of Lemma 15 in [17] extends plainly to cover this case as well. Having (8.6) in place we can then proceed as follows.
For given and fixed, set and consider the stopping time for if belongs to for . Inserting this under the expectation sign in (6.5) and making use of (8.6) we find that
[TABLE]
for all if belongs to for . Taking in (8.7) sufficiently small we see that which shows that belongs to as claimed.
3. The three straight lines naturally split the stopping set into the three subsets
[TABLE]
Note that the set is surrounded by the straight lines and , the set is surrounded by the straight lines and , and the set is surrounded by the straight lines and . Clearly and the sets are disjoint (see Figure 1 below).
Proposition 7. The sets are convex.
Proof. We will show that the set is convex and the same arguments can be used to show that the sets and are convex. For this, let and belonging to and be given and fixed. Firstly, note that
[TABLE]
where we use (4.13) to infer that for belonging to the subset of surrounded by and . Secondly, using that is concave on as established in (8.4) above, we find that
[TABLE]
where in the first equality we use that and belong to . Combining (8.11) and (8.12) we see that \hat{V}\big{(}\lambda(\varphi_{1}^{\prime},\varphi_{2}^{\prime})\!+\!(1\!-\!\lambda)(\varphi_{1}^{\prime\prime},\varphi_{2}^{\prime\prime})\big{)}=\hat{M}\big{(}\lambda(\varphi_{1}^{\prime},\varphi_{2}^{\prime})\!+\!(1\!-\!\lambda)(\varphi_{1}^{\prime\prime},\varphi_{2}^{\prime\prime})\big{)} showing that belongs to as needed.
4. To describe the shape of the stopping sets we may recall from Section 7 that the subsets \big{(}[0,1/\beta]\cup[\beta,\infty)\big{)}\!\times\!\{0\} and \{0\}\!\times\!\big{(}[0,1/\beta]\cup[\beta,\infty)\big{)} of are contained in where solves (7.19) uniquely. Symmetry arguments to be addressed shortly below show that it is sufficient to focus on the set as the conclusions will directly extend to the sets and as well. Moving from the straight lines and in to the right, let us formally define the (least) boundary between and by setting
[TABLE]
for . Clearly the infimum in (8.13) is attained since is closed. We now show that constitutes the entire boundary of in (see Figure 1 below).
Proposition 8. The mapping is finite valued on and we have
[TABLE]
with and as .
Proof. To derive (8.14) we show that
[TABLE]
for all . For this, recall from (8.4) that is concave on while is constant for . Hence if due to with meaning that for some , then must converge to as converges to . This however contradicts the fact that is non-negative and hence (8.15) must hold as claimed. Combining (8.13) and (8.15) we see that (8.14) is satisfied as claimed.
To establish that is finite valued we first show that
[TABLE]
for all when . (Note that the latter inequality cannot be omitted and (8.16) may fail when as we will see in Section 10 below.) For this, recall from (8.4) that is concave on while is linear for . By the results of Section 7 we know that belongs to so that when . Hence if due to then for all . This shows that (8.16) holds as claimed.
From (8.16) we see that if for some then is increasing on . In particular, this means that if for some then for all . We will now use this fact to show that is finite valued as claimed.
Assuming that for some , and fixing , it follows from the previous argument that the rectangle is contained in for every with some large enough. Consider the stopping time
[TABLE]
for . Since we see that and hence it follows that
[TABLE]
for all . Noting that \mathsf{E}\>\!_{0}\big{[}\tau_{R_{N}^{c}}^{\varphi_{1},\varphi_{2}}\big{]}\rightarrow\mathsf{E}\>\!_{0}\big{[}\tau_{(a,b)^{c}}^{\varphi_{2}}\big{]} where as , we see from (8.18) that
[TABLE]
for all with some large enough. Letting and using that \mathsf{E}\>\!_{0}\big{[}\tau_{(a,b)^{c}}^{\varphi_{2}}\big{]}>0 we obtain a contradiction. Thus there is no such that and hence is finite valued as claimed.
Finally, the fact that was established in Section 7 above. Moreover, since for all due to and being contained in , we see that as and the proof is complete.
Proposition 9. The mapping is convex and continuous on .
Proof. Convexity of the mapping on follows from the convexity of the stopping set as established in Proposition 7 above. Hence the mapping is continuous on while cannot make a jump at [math] due to the fact that the stopping set is closed. This completes the proof.
We will show in Section 10 below that for with such that . This fact combined with the convexity of on means that the mapping is (firstly) decreasing on and (then) increasing on with some . In addition to these facts about around zero we will conclude this section by evaluating the asymptotic behaviour of at infinity. Before we do that we will turn to the remaining two stopping sets and including their boundaries.
5. Symmetry arguments enable us to extend the setting and results of Proposition 8 and Proposition 9 from the stopping set to the remaining two stopping sets and . For this, recall from (4.3) that and . Since play a symmetric role in the optimal stopping problem (3.8) we see that any permutation of the three coordinates should yield the same result. There are two generic permutations which generate all the others (six in total). The first generic permutation is obtained by swapping and while keeping intact. This yields and showing that
[TABLE]
where can also be replaced by or . The second generic permutation is obtained by swapping and while keeping intact. This yields and showing that
[TABLE]
where can also be replaced by or . The remaining four equivalencies can be obtained by combining (8.20) and (8.21). For example, applying first (8.20) and then (8.21) we find that (where can also be replaced by or as above) which is obtained by swapping and while keeping intact.
6. Having understood the symmetry relations we now move to extending the setting and results of Proposition 8 and Proposition 9 from to and . We first address the case of which in view of (8.20) is a mirror image of across the main diagonal in . In analogy with (8.13) we thus define the (least) boundary between and by setting
[TABLE]
for . Clearly the infimum in (8.22) is attained since is closed. Similarly to and above we now show that constitutes the entire boundary of in (see Figure 1 below).
Proposition 10. The mapping is finite valued on and we have
[TABLE]
with and as .
Proof. This can be derived in exactly the same way as in Proposition 8 above. Alternatively Proposition 10 also follows directly from Proposition 8 using the symmetry relation (8.20) which shows that is a mirror image of across the main diagonal in .
Proposition 11. The mapping is convex and continuous on .
Proof. This can be derived in exactly the same way as in Proposition 9 above. Alternatively Proposition 11 also follows directly from Proposition 9 using the symmetry relation (8.20) which shows that coincides with on .
Despite the fact that the functional rules of and coincide on , we will still keep their different subscripts and in place to account for different arguments in and for and respectively.
6. We next address the case of which in view of (8.21) can similarly be linked to the case of in a one-to-one way. Moving from the point down to the point along the main diagonal in , we know that there exists the (first) point that belongs to . Equivalently can also be formally defined by
[TABLE]
Clearly the supremum in (8.24) is attained since is closed and we have since . Similarly to (8.13) and (8.22) we then define the (least) upper boundary between and by setting
[TABLE]
for , and the (least) lower boundary between and by setting
[TABLE]
for . Clearly the suprema in (8.25) and (8.26) are attained since is closed. In view of (8.20), it is clear that the graphs of and are mirror images of each other across the main diagonal in , so that on and we set
[TABLE]
for . Similarly to Proposition 8 and Proposition 10 above, we now show that can be used to describe the entire boundary of in (see Figure 1 below).
Proposition 12. The following identity holds
[TABLE]
with and . The mapping is concave and conti- nuous on .
Proof. All claims follow by convexity (and closeness) of established in Proposition 7 above combined with the symmetry relations (8.20) and (8.21). The latter symmetry relation links to in a one-to-one way and this enables us to conclude that as claimed. The final claim is evident from (8.24)-(8.26) above.
The one-to-one correspondence between and obtained by the symmetry relation (8.21) enables us to transfer the facts stated following Proposition 9 above from to . In particular, this yields that the mapping is (firstly) increasing on and (then) decreasing on for some (see Figure 1 below).
7. Another consequence of the one-to-one correspondence between and (and hence as well) is the possibility to describe the asymptotic behaviour of and at infinity.
Proposition 13. We have
[TABLE]
Proof. The first equality follows by the symmetry relation (8.20) implying that coincides with on so that it is enough to establish the second equality in (8.29). For this, note that the symmetry relation (8.21) yields
[TABLE]
for . Note also that tends to and tends to as . The fact that the point belongs to means that this point can be identified with for some with as . This shows that
[TABLE]
as . This establishes (8.29) and the proof is complete.
We will continue our study of the sets in Section 10 below.
9 Smooth fit
In this section we show that the value function from (4.18) satisfies the smooth fit condition at the optimal stopping boundaries . A key point in the proof is based upon the fact that the boundary points are Green regular for in the sense that the first entry time of into satisfies
[TABLE]
with -probability one whenever from tends to at the boundary for as . The Green regularity follows from the fact that the boundary points are probabilistically regular for in the sense that for every at the boundary for combined with the fact that the process is strong Feller which is evident from (5.8) above (cf. [5, Section 3]). The probabilistic regularity is a consequence of the fact that the sets are convex (as established in Proposition 7 above) so that in view of (5.8) each boundary point from satisfies Zaremba’s cone condition for with (see e.g. [12, Theorem 3.2, p. 250]). These facts establish (9.1) and we can now state the main result of this section.
Proposition 14 (Smooth fit). For the value function from (4.18) we have
[TABLE]
for all with .
Proof. We will establish (9.2) and (9.3) for and similar arguments can be used for and . For this, let with be given and fixed in the sequel.
1. We show that (9.2) holds. For this, we first note that
[TABLE]
since and with being constant for . We next show that
[TABLE]
For this, let denote the first entry time of into for given and fixed. Since is optimal for we find by (5.8) that
[TABLE]
for all with some sufficiently small, where in the final equality we use (6.4) combined with the two implications (9.7) below which we motivate and derive first.
Recalling (6.4) and definitions of stated afterwards, we claim that
[TABLE]
for with some sufficiently small and .
To show (9.7) for recall that and are contained in so that the continuous curve stays away from the straight line in particular. Setting to simplify the notation throughout this shows that there exists sufficiently small such that the right-hand side in (9.7) with implies that for . This imp- lies that for all with given and fixed. It follows that if we choose small enough. This shows that (9.7) holds for as claimed.
To show (9.7) for set to simplify the notation throughout and note that (8.29) shows that there exists sufficiently small such that the right-hand side in (9.7) with implies that for . This implies that for all with given and fixed. It follows that if we choose small enough. This shows that (9.7) holds for as claimed.
Making now use of (6.4) and (9.7) in the middle term of (9.6) above, upon noting that always equals one among , , respectively, we see that the final equality in (9.6) holds as claimed. Dividing both sides of (9.6) by we obtain
[TABLE]
for all . Letting and using that the right-hand side in (9.8) tends to zero by (9.1) and the continuity of we see that (9.5) holds as claimed. Combining (9.4) and (9.5) with the fact that we see that (9.2) holds as claimed.
2. We show that (9.3) holds. For this, we first note that
[TABLE]
depending on whether or belongs to for respectively. In (9.8) and (9.9) we use that and with being linear for . We next show that
[TABLE]
depending on whether or belongs to for respectively. For this, let denote the first entry time of into for given and fixed. Since is optimal for we find by (5.8) that
[TABLE]
for all with some sufficiently small, where in the final equality we use (6.4) and (9.7) similarly as in (9.6) above. Dividing both sides of (9.13) by we obtain
[TABLE]
for all . Letting and using that the right-hand side in (9.14) and (9.15) tends to by (9.1) and the continuity of we see that (9.11) and (9.12) hold as claimed. Combining (9.9)+(9.10) and (9.11)+(9.12) respectively with the fact that we see that (9.3) holds as claimed. This completes the proof.
Corollary 15 ( regularity ). For the value function from (4.18) we have
[TABLE]
Proof. We have established in Proposition 14 that is differentiable on . By (8.4) we know that is concave on . The claims (9.16) and (9.17) then follow from the general fact that concave differentiable functions are continuously differentiable on open sets (see e.g. [3, Theorem 2.2.2]). This completes the proof.
10 Non-monotonicity of the optimal stopping boundaries
In this section we show that the optimal stopping boundaries are non-monotone as functions of their arguments and prove the existence of a ‘belly’ which determines their curvature/shape. In the first part of the proof we introduce the local time of on a fictitious curve which enables us to decompose the two-dimensional optimal stopping problem into two one-dimensional optimal stopping problems which can be solved explicitly. In the second part of the proof we follow the general hint from [17, Remark 13] on establishing the absence of jumps of the optimal stopping boundaries and make use of Hopf’s boundary point lemma to derive a contradiction with the directional smooth fit. In view of the symmetry relations (8.20)+(8.21) it is sufficient to focus on the optimal stopping boundary and these facts then extend to the optimal stopping boundaries and as discussed in Section 8 above.
1. To derive that the optimal stopping set has a ‘belly’ as displayed on Figure 1 below, we first show that not only the point belongs to as derived in Section 7 above but also a non-trivial vertical segment above is contained in .
Proposition 16. For the stopping set from (8.10) we have
[TABLE]
for some small enough.
Proof. The idea is to introduce the local time of on the line
[TABLE]
and decompose the two-dimensional optimal stopping problem (4.18) into two one-dimensional optimal stopping problems that can be solved explicitly.
For this, set throughout and consider the Lagrange reformulation (6.5) of the optimal stopping problem (4.18) that yields
[TABLE]
for where the infimum is taken over all stopping times of . Since the left-hand side of (10.3) is non-positive, it is enough to show that the left-hand side of (10.3) is non-negative for all sufficiently small. For this, adding and subtracting under the expectation sign in (10.3) and noting that
[TABLE]
we find that
[TABLE]
for where in the equality we use the Itô-Tanaka formula (cf. [20, p. 223]) applied to , and the change-of-variable formula with local time on surfaces [16, Theorem 2.1] applied to similarly to (6.9) above with
[TABLE]
for , both combined with the optional sampling theorem upon using that and are martingales under . In the final inequality of (10.5) we use that is an optimal stopping point in the one-dimensional optimal stopping problem for as established in Section 7 above as well as that for as claimed.
Motivated by the right-hand side in (10.5) above, consider the optimal stopping problem
[TABLE]
for with where the process and its infinitesimal generator are given by (7.2)+(7.3) and (7.4) above, and the infimum in (10.7) is taken over all stopping times of . The optimal stopping problem (10.7) is similar to the optimal stopping problem (7.1) and we can use similar arguments to tackle it. Denoting the loss function in (10.7) by for it follows that the free-boundary problem now reads
[TABLE]
where are the optimal stopping/boundary points to be found and we have for as well (in addition to (10.9) above).
The general solution to the ordinary differential equation (10.8) is given by
[TABLE]
for where and are two undetermined real constants. Boundary conditions (10.9) and (10.10) then read as follows
[TABLE]
It is a matter of routine to verify that the unique solution to (10.12)-(10.15) is given by
[TABLE]
Note that and as needed. Inserting and from (10.17) to (10.11) we obtain a candidate value function for the optimal stopping problem (10.7). Applying the Itô-Tanaka formula (cf. [20, p. 223]) to composed with , which reduces to Itô’s formula due to smooth fit (10.10), and making use of the optional sampling theorem, it is easily verified that coincides with the value function from (10.7) and the optimal stopping time (at which the infimum in (10.7) is attained) is given by
[TABLE]
where and are given by (10.16) above. This in particular shows that the interval is contained in the stopping set of the optimal stopping problem (10.7). Translating this conclusion to the right-hand side of (10.5) above we see that its value equals zero whenever belongs to . It follows therefore from (10.3) and (10.5) that in (10.1) can be taken to be equal to and the proof is complete.
2. We now show that the ‘belly’ of the optimal stopping set is not flat but curved (see Figure 1 above). For this, suppose that this is not the case. Then with and for some with and some with . The initial claim is then a direct consequence of the following fact.
Proposition 17. If the ‘belly’ of the optimal stopping set would be flat as described above, then the horizontal smooth fit condition (9.2) would fail on .
Proof. Suppose that the ‘belly’ of the optimal stopping set is flat as described above. Set and with . Recalling the Lagrange reformulation (6.5) of the optimal stopping problem (4.18), and arguing as in the proof of Theorem 12 in [17], we find that the value function from (4.18) solves the equation
[TABLE]
on and belongs to where is given by (5.9) above and we set
[TABLE]
for . Differentiating both sides of (10.19) with respect to and defining the differential operator by setting
[TABLE]
we find that solves the equation
[TABLE]
on . We will now complete the proof in two steps as follows.
1. We claim that the strict inequality holds
[TABLE]
for all . For this, suppose that (10.23) fails for some . Recalling that , consider the ball with centre at and radius small enough so that , where is defined following (6.4) above. Enlarge by setting and note that the same arguments as above show that the equations (10.19) and (10.21) hold on too. Since the coefficients of are continuous and the set is bounded we can conclude that is uniformly elliptic on (cf. [10, p. 31]). The hypothesis that (10.23) fails for some , combined with the fact that on by (8.4) above, implies that so that attains its maximum in the interior of (i.e. not at its boundary alone). Hence by the strong maximum principle for elliptic equations (see Theorem 3.5 in [10, p. 35] and the second sentence following its proof) we can conclude that on the entire . This in particular means that is linear on . Since is linear on as well, and the vertical smooth fit (9.3) holds at , it follows that for all so that which is a contradiction. This establishes that (10.23) is satisfied as claimed.
2. Fix any point in and note that since and for . Hence we see that (10.23) reads as for all . Moreover, we know that is uniformly elliptic and holds on by (10.22) above. Finally, it is evident that satisfies an interior sphere condition at ( i.e. there exist and such that and ). These facts show that Hopf’s boundary point lemma for elliptic equations (see [10, Lemma 3.4 p. 34]) is applicable and thus the outer normal derivative of at must be strictly positive. In other words, we have
[TABLE]
This conclusion shows that the horizontal smooth fit condition (9.2) cannot hold on as claimed, since otherwise we would have due to , and the proof is complete.
11 Free-boundary problem
In this section we derive a free-boundary problem that stands in one-to-one correspondence with the optimal stopping problem (4.18) and establish the fact that the value function and the optimal stopping boundary solve the free-boundary problem uniquely. These considerations will be continued in the next section.
1. Consider the optimal stopping problem (4.18) where the strong Markov/Feller process solves the system of stochastic differential equations (5.6)+(5.7). Recalling that the infinitesimal generator of is given by (5.9) above, and relying on other properties of and derived in Section 8 above, we are naturally led to formulate the following free-boundary problem for finding and :
[TABLE]
where is given by (10.20) above and is given by (4.13) above. The continuation set and the stopping set are formally defined by (8.1) and (8.2) respectively. We know from the results of Section 8 that the optimal stopping boundary can be fully described by means of the functions and defined in Section 8 above via the equivalence if and only if either and when for or and for where are given by (8.8)-(8.10) above (see Figure 1 above). Clearly the global condition (11.2) can be replaced by the local condition on so that the free-boundary problem (11.1)-(11.3) needs to be considered on the closure of only ( extending to the rest of as ).
2. To formulate the existence and uniqueness result for the free-boundary problem (11.1)-(11.3) we let denote the class of functions such that
[TABLE]
where is the open set surrounded by and (applied twice).
Theorem 18. The free-boundary problem (11.1)-(11.3) has a unique solution in the class where is given by (4.18) while and are defined in Section 8 above.
Proof. Combining the results of Proposition 5 and Corollary 15 with the arguments leading to (10.19) above, we see that the value function from (4.18) satisfies (11.4) and solves the boundary value problem (11.1)-(11.3) with described by and from Section 8 as recalled above. Moreover, combining the results of Propositions 8-12 we see that and satisfy (11.5) and (11.6) respectively. This shows that solves the free-boundary problem (11.1)-(11.3) in the class as claimed. To derive uniqueness of the solution we will first see in the next section that any solution to the free-boundary problem (11.1)-(11.3) in the class admits a closed triple-integral representation of expressed in terms of and , which in turn solve a coupled system of nonlinear Fredholm integral equations, and we will see that this system cannot have other solutions satisfying the specified properties. Drawing these facts together we can conclude that there cannot exist more than one solution to the free-boundary problem (11.1)-(11.3) in the class as claimed.
12 Nonlinear integral equations
In this section we show that the optimal stopping boundaries and can be characterised as the unique solution to a coupled system of nonlinear Fredholm integral equations (recall that coincides with in terms of its functional rule). This also yields a closed triple-integral representation of the value function expressed in terms of the optimal stopping boundaries and . As a consequence of the existence and uniqueness result for the coupled system of nonlinear Fredholm integral equations we also obtain uniqueness of the solution to the free-boundary problem (11.1)-(11.3) as explained in the proof of Theorem 18 above. Finally, collecting the results derived throughout the paper we conclude our exposition at the end of this section by disclosing the solution to the initial problem.
1. To formulate the theorem below, let denote the transition probability density function of the (time-homogeneous) Markov process under in the sense that
[TABLE]
for with and in . A lengthy but straightforward calculation based on (5.8) shows that
[TABLE]
for with and in . Recalling from Section 8 above that the functions and are sufficient to describe the entire boundary of the continuation set, we can then evaluate the expression of interest in the theorem below as follows
[TABLE]
for where the final equality follows by symmetry relative to the main diagonal in and we recall that is defined in (10.20) above.
Theorem 19 (Existence and uniqueness). The optimal stopping boundaries and in the problem (4.18) can be characterised as the unique solution to the coupled system of nonlinear Fredholm integral equations
[TABLE]
in the class of functions and satisfying (11.5) and (11.6) respectively, where in (12.4) belongs to with for some and in (12.5) belongs to . The value function in the problem (4.18) admits the following representation
[TABLE]
for . The optimal stopping time in the problem (4.18) is given by
[TABLE]
under with given and fixed (see Figure 1 above).
Proof. (I) Existence. We first show that the value function in the problem (4.18) admits the representation (12.6) and that the optimal stopping boundaries and solve the system (12.4)+(12.5). Recalling that and satisfy the properties (11.5) and (11.6) this will establish the existence of a solution to the system (12.4)+(12.5).
For this, recall that by (8.4) in Proposition 5 we know that is concave and from Corollary 15 we know that is globally on . These properties however are generally insufficient to apply a known extension of Itô’s formula to due to not knowing the size of the second partial derivatives , , close to the optimal stopping boundaries. Note that we know that the optimal stopping boundaries are convex/concave, however, this is generally insufficient to derive a local boundedness of the second partial derivatives close to the optimal stopping boundaries (without having their smoothness) using the generally theory of elliptic PDEs (see [10]). A semimartingale decomposition of obtained by Itô’s formula is useful because it leads to Dynkin’s formula (upon localising, taking expectations, and passing to the limit) which in turn yields the representation (12.6). We will show in the proof below that Dynkin’s formula can be derived without appealing to Itô’s formula and/or without formally verifying that the second partial derivatives are locally bounded close to the optimal stopping boundaries. This will be accomplished in several steps below by exploiting the underlying convexity/concavity in the problem (4.18) combined with the fact that the expectation of the running local time of on the (approximating) optimal stopping boundaries remains uniformly bounded as the time tends to infinity (recall that itself converges to zero so that this is rather intuitive).
1. We begin by localising the process . For this, let be given and fixed (large) and consider the first exit time of from the square given by
[TABLE]
Let denote the process stopped at . Clearly the process stays in the square all the time while both and are continuous and thus bounded on for . As we have not established that , , are locally bounded close to the optimal stopping boundaries, we proceed by modifying the value function within the continuation set close to its boundary.
2. For given and fixed (large) define the sets and . Set and where are defined following (6.4) above for . Clearly as for . Using the same arguments as in the proof of Proposition 7 above we find that each set is convex for . Hence we can conclude that the boundary of restricted to the square converges uniformly to the boundary restricted to the square as for . Thus, as in the case of the sets and their boundaries , the boundary of the set restricted to the square is described by a concave/continuous function and the boundaries of the sets and are described by a convex/continuous function for all with sufficiently large.
3. We approximate the value function by functions defined as follows
[TABLE]
for with given and fixed. Clearly is a continuous function on and moreover restricted to and belongs to and respectively. Thus the change-of-variable formula with local time on surfaces [16, Theorem 2.1] is applicable to composed with and this gives
[TABLE]
for using (11.1) and (11.2) where is a continuous martingale (the sum of the first two integrals in the first identity of (12.10) above) and is the sum of the final four integrals in the first identity of (12.10) above. Note that the first partial derivatives and are discontinuous over the boundary curves and because these boundary curves are not optimal. However, since is globally on by Corollary 15, it follows that
[TABLE]
for as . Note that the suprema in (12.11) and (12.12) for provide uniform upper bounds on the modulus of the integrands in the four integrals of (12.10) with respect to the local times. To obtain a control over the local times themselves in these four integrals (their integrators) we now show that their expectations remain uniformly bounded as the running time tends to infinity.
4. We first consider the case of and recalling that the two functions coincide by symmetry for given and fixed. We thus focus on in the sequel. Since is concave we see that is a continuous semimartingale so that by the Itô-Tanaka formula we find that
[TABLE]
for where denotes the first derivative of (its existence follows by the implicit function theorem since smooth fit fails at as pointed out above). Since is concave we see that defines a non-positive measure on so that the final integral in (12.13) is non-positive. Using this fact in (12.13) we obtain the following pathwise bound on the size of the local time
[TABLE]
where is a continuous martingale (the difference between the second and the third integral in (12.13) above) for . Taking on both sides of (12.14) above and using that for all we find that
[TABLE]
for all and all with and (where the case follows from the case by symmetry).
5. We next consider the case of and recalling that the two functions coincide by symmetry for given and fixed. We thus focus on in the sequel. Similarly, since is convex we see that is a continuous semimartingale so that by the Itô-Tanaka formula we find that
[TABLE]
for where denotes the first derivative of (its existence follows by the implicit function theorem since smooth fit fails at as pointed out above). Since is convex we see that defines a non-negative measure on so that the second last integral in (12.16) is non-negative. Using this fact in (12.16) we obtain the following pathwise bound on the size of the local time
[TABLE]
where is a continuous martingale (the difference between the second and the final integral in (12.16) above) for . Taking on both sides of (12.17) above and using that with we find that
[TABLE]
for all and all with .
6. Combining (12.11)+(12.12) with (12.15)+(12.18) we find that \mathsf{E}\>\!_{\varphi_{1},\varphi_{2}}^{0}\big{[}L_{t}^{n,N}\big{]}\rightarrow 0 as for every and given and fixed. Taking on both sides of (12.10), letting and using the monotone convergence theorem due to , we obtain the following identity
[TABLE]
for and with . Recalling that where is defined in (4.13) above, and noting that \mathsf{E}\>\!_{\varphi_{1},\varphi_{2}}^{0}\big{(}\sup_{0\leq s\leq t}\varPhi_{s}^{i}\big{)}<\infty for , we see by letting that the dominated convergence theorem is applicable to the left-hand side of (12.19), while the monotone convergence theorem is applicable to the right-hand side of (12.19) since . Letting in (12.19) we thus obtain
[TABLE]
for and .
7. Despite the fact that neither nor is uniformly integrable (since with -probability one as but for all with and given and fixed) we claim that
[TABLE]
where we recall that is defined in (4.13) above. For this, note that 0\leq\hat{M}(\varPhi_{t}^{1},\varPhi_{t}^{2})=c\;\!\big{(}(\varPhi_{t}^{1}\!+\!\varPhi_{t}^{2})\wedge(1\!+\!\varPhi_{t}^{1})\wedge(1\!+\!\varPhi_{t}^{2})\big{)}\leq c\;\!\big{(}(1\!+\!\varPhi_{t}^{1})\wedge(1\!+\!\varPhi_{t}^{2})\big{)}=c\;\!\big{(}1\!+\!\varPhi_{t}^{1}\wedge\varPhi_{t}^{2}\big{)} for . A direct martingale argument based on (5.8) then gives
[TABLE]
as for . Since with -probability one as for given and fixed, we see from (12.22) that is uniformly integrable. Hence by the bound preceding to (12.22) we see that (12.21) holds as claimed.
8. Since for we see from (12.21) that is uniformly integrable. Letting in (12.20) and using that with -probability one we thus find by the extended dominated convergence theorem (applied to the left-hand side) and the monotone convergence theorem (applied to the right-hand side) that the following identity holds
[TABLE]
. Combining (12.23) with (12.3) we obtain (12.6) as claimed. Evaluating from (12.23) at the optimal stopping points and upon using that and for and respectively, we see that the functions and solve the integral equations (12.4) and (12.5) as claimed. This completes the proof of the existence of the solution to these equations.
(II) Uniqueness. To show that and are a unique solution to the system (12.4)+(12.5) one can adopt the four-step procedure from the proof of uniqueness given in [6, Theorem 4.1] extending and further refining the original arguments from [15, Theorem 3.1] in the case of a single boundary. Given that the present setting creates no additional difficulties we will omit further details of this verification and this completes the proof.
The coupled system of nonlinear Fredholm integral equations (12.4)+(12.5) can be used to find the optimal stopping boundaries and numerically (using Picard iteration). Inserting these and into (12.6) we also obtain a closed form expression for the value function . Collecting the results derived throughout we now disclose the solution to the initial problem.
Corollary 20. The value function of the initial problem (3.3) is given by
[TABLE]
for with where the function is given by (12.6) above. The optimal stopping time in the initial problem (3.3) is given by
[TABLE]
where and are a unique solution to the coupled system of nonlinear Fredholm integral equations (12.4)+(12.5). The optimal decision function in the initial problem (3.3) equals [math] if stopping in (12.25) happens at , equals if stopping in (12.25) happens at with , and equals is stopping in (12.25) happens at with .
Proof. The identity (12.24) was established in (4.11) above. The explicit form (12.25) follows from (12.7) in Theorem 19 combined with (4.2)-(4.4) above. The final claim on the optimal decision function follows from (3.7) combined with the argument used in the second equality of (4.15) above completing the proof.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] Bayraktar, E. and Kravitz, R. (2014). Quickest search over Brownian channels. Stochastics 86 (473–490).
- 3[3] Borwein, J. M. and Vanderwerff, J. D. (2010). Convex Functions: Constructions, Characterizations and Counterexamples . Cambridge University Press.
- 4[4] Dayanik, S. Poor, H. V. and Sezer, S. O. (2008). Sequential multi-hypothesis testing for compound Poisson processes. Stochastics 80 (19–50).
- 5[5] De Angelis, T. and Peskir, G. (2016). Global C 1 superscript 𝐶 1 C^{1} regularity of the value function in optimal stopping problems. Research Report No. 13, Probab. Statist. Group Manchester (29 pp). Submitted.
- 6[6] Du Toit, J. and Peskir, G. (2009). Selling a stock at the ultimate maximum. Ann. Appl. Probab. 19 (983–1014).
- 7[7] Feller, W. (1952). The parabolic differential equations and the associated semi-groups of transformations. Ann. of Math. 55 (468–519).
- 8[8] Gapeev, P. V. and Peskir, G. (2004). The Wiener sequential testing problem with finite horizon. Stoch. Stoch. Rep. 76 (59–75).
