Optimally stopping at a given distance from the ultimate supremum of a spectrally negative L\'evy process
M\'onica B. Carvajal Pinto, Kees van Schaik

TL;DR
This paper solves an optimal stopping problem for spectrally negative Lévy processes, characterizing the optimal strategy explicitly and revealing a threshold-based structure depending on the distance parameter.
Contribution
It provides a fully explicit solution to the stopping problem using scale functions, revealing a novel threshold-based decision rule depending on the parameter $b$.
Findings
Optimal stopping rule characterized explicitly.
Threshold structure depends on the parameter $b$.
Solution applicable under mild conditions.
Abstract
We consider the optimal prediction problem of stopping a spectrally negative L\'evy process as close as possible to a given distance from its ultimate supremum, under a squared error penalty function. Under some mild conditions, the solution is fully and explicitly characterised in terms of scale functions. We find that the solution has an interesting non-trivial structure: if is larger than a certain threshold then it is optimal to stop as soon as the difference between the running supremum and the position of the process exceeds a certain level (less than ), while if is smaller than this threshold then it is optimal to stop immediately (independent of the running supremum and position of the process). We also present some examples.
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.
Optimally stopping at a given distance from the ultimate supremum of a spectrally negative Lévy process
Mónica B. Carvajal Pinto***School of Mathematics, University of Manchester. Oxford Road, Manchester, M13 9PL, United Kingdom. E-mail: [email protected]/kees.[email protected] and Kees van Schaik11footnotemark: 1
Abstract
We consider the optimal prediction problem of stopping a spectrally negative Lévy process as close as possible to a given distance from its ultimate supremum, under a squared error penalty function. Under some mild conditions, the solution is fully and explicitly characterised in terms of scale functions. We find that the solution has an interesting non-trivial structure: if is larger than a certain threshold then it is optimal to stop as soon as the difference between the running supremum and the position of the process exceeds a certain level (less than ), while if is smaller than this threshold then it is optimal to stop immediately (independent of the running supremum and position of the process). We also present some examples.
Keywords: spectrally negative Lévy process, optimal prediction, optimal stopping, scale functions.
Mathematics Subject Classification (2000): 60G40, 62M20
1 Introduction
Let be a spectrally negative Lévy process starting from [math] defined on a filtered probability space , where is the filtration generated by which is naturally enlarged (cf. Definition 1.3.38 in [8]). We denote its running supremum by
[TABLE]
In this paper we consider the optimal prediction problem
[TABLE]
where is a non-negative continuous penalty function and the infimium is taken over all adapted stopping times . To avoid trivialities we restrict ourselves to the case that a.s. and . In particular we focus on the case that
[TABLE]
This means that we are looking for the stopping time such that is closest to under a squared error penalty (as commonly used in many areas of optimisation and estimation).
This is a challenging problem. One reason is that the decision to stop has to be made before the value of the ultimate supremum is fully known (it is still tractable though due to the homogeneity properties of a Lévy process). A further complication is that the presence of (unpredictable) negative jumps in means that a path of may suddenly jump from high levels to much smaller levels and then even drift off to before ever returning to anywhere near the previously attained high levels. Our main result fully characterises the solution (under some mild conditions) and shows that there are two types of solutions. If is smaller than a particular threshold then it is optimal to stop immediately, while if is larger than this threshold then it is optimal to stop as soon as the difference exceeds a certain level (typically strictly smaller than ).
Applications of this problem can for instance be found in (mathematical) finance and insurance. In finance Lévy processes have received a lot of attention in recent years as an alternative model for the evolution of (the log of) a financial index, extending the classic Black & Scholes model. See e.g. the textbooks [21] & [23] and the references therein to name only some. In such a model, the ultimate supremum represents the maximal value the index will attain and hence the problem studied in this paper can be used by an agent to evaluate when is a good (or even the optimal) time to sell shares held in the index. By considering the solution to the problem for different values of , a sequence of ‘alarms’ leading up to the optimal time can be created to inform the agent’s investment strategy.
In insurance, a spectrally negative Lévy process is a popular extension of the classic Cramér-Lundberg model modelling the evolution of the surplus associated with a portfolio of products (in the presence of premium income and outgo due to claim payments). See e.g. the textbooks [3] & [17] and the references therein. In this context, the fact that the ultimate supremum is finite means that the so-called Net Profit Condition is not satisfied i.e. on average the portfolio generates a loss per time unit. This may be because the insurer is trying to gain exposure in the consumer market or because a speculative agent is holding the portfolio. The sequence of ‘alarms’ mentioned above can in this application similarly be used by the speculative agent to sell it or for the insurer to start dismantling the portfolio.
An optimisation problem of the type (1), where the payoff at any time i.e. is not adapted to is typically referred to as an optimal prediction problem (and this aspect is exactly what distinguishes optimal prediction problems from the classic field of optimal stopping problems). Such problems have received a lot of attention in recent years, see e.g. [1, 4, 5, 6, 9, 10, 11, 12, 13, 14]. Several of these papers have considered the problem of predicting the ultimate supremum of a Brownian motion (with drift), also with a finite time horizon, and of the special case of a spectrally positive stable Lévy process.
Before discussing the contents of this paper in more detail let us note some facts about Lévy processes (all of which can be found in [18], see also [7] and [20] e.g.). Recall that a Lévy process has stationary independent increments and that its law is characterised by a triplet , where , and is a measure on satisfying the integrability condition
[TABLE]
It is spectrally negative when it has no positive jumps i.e. and when is not a subordinator.
For the spectrally negative Lévy process , its Laplace exponent
[TABLE]
is finite at least for all . Further is infinitely often differentiable and strictly convex on the interior of its domain (which is necessarily an interval), with and . Hence we can define its right inverse as
[TABLE]
Further it is well known that
[TABLE]
If the conditions in (4) hold, which we will assume throughout, we have that and . The condition hence boils down to
[TABLE]
For any , we define the process as the process reflected in its running supremum, started from level i.e.
[TABLE]
It is well known that is a strong Markov process. Note that under the standing assumption (4) we have that a.s. as . An interpretation of in (6) is that the process was started at some time prior to and that at we observe the reflected distance to be .
The rest of this paper is organised as follows. In Section 2 we state and discuss our main results. We first use standard arguments to express the optimal prediction problem (1) as an equivalent optimal stopping problem driven by the above process . After showing that the problem is trivial when is non-decreasing we turn to the case of the quadratic penalty function (2), and fully characterise and discuss the solution for that case in Theorem 2.5. Section 3 contains a proof of Theorem 2.5 (which is a bit of work). Finally, in Section 4 we look at some specific examples of spectrally negative Lévy processes and further illustrate the results from Theorem 2.5.
2 Main results and discussion
Recall that throughout we assume that satisfies the conditions in (4) and that (5) holds. In the first lemma we show, using standard arguments, that the optimal prediction problem (1) can be expressed as an optimal stopping problem driven by the process .
Lemma 2.1**.**
Let the non-negative function be given by
[TABLE]
and further define the function as
[TABLE]
where the infimum is taken over all stopping times with respect to the naturally enlarged filtration generated by .
Then equals (1).
Proof.
Since is non-negative, we can assume in the below w.l.o.g. that is bounded (the result can be extended using monotone convergence otherwise). We closely follow the proof of Lemma 1 in [11], first to establish for any that
[TABLE]
Using that (cf. (4)), a straightforward computation shows that the above right hand side equals . An application of Hunt’s Lemma (cf. e.g. E14.1 in [24]) now yields the result. ∎
Note that for , we can understand to be equivalent to (1) in the situation that was started at some time prior to and at we observe the reflected distance to be .
Remark 2.2**.**
We only consider penalty functions for which exists (possibly infinite). Then exists as well, and since both and have well defined limits as we can allow for valued stopping times both in (1) and (8).
It is not hard to show that if the penalty function is non-decreasing then it is for optimal to stop immediately. Apparently the homogeneity of , also keeping in mind that drifts to , guarantees that waiting is suboptimal and that (1) is equal to .
Lemma 2.3**.**
If is non-decreasing then is optimal in (1).
Proof.
By virtue of Lemma 2.1 above, since it suffices to show that is non-decreasing. For this, take any and note that integration by parts yields
[TABLE]
so that
[TABLE]
Since is non-decreasing we have that
[TABLE]
and hence indeed . ∎
Remark 2.4**.**
Of course, the above Lemmas 2.1 & 2.3 do not rely on being spectrally negative. In particular, is optimal in (1) for any Lévy process whose ultimate supremum is finite a.s.
Now we turn to the more interesting case of a quadratic penalty function of the form
[TABLE]
in which case as defined in (7) boils down to
[TABLE]
Note that the shape of is preserved in in the sense that is , , for , , resp. with and . Hence it makes sense to expect that in the optimal stopping problem (8) it is optimal to stop when is close to i.e. when the distance between the running supremum and the position of is close to .
However, keeping in mind that drifts to , for any it is not obvious whether it is better to stop and accept the payoff or to wait until moves closer to while risking that it drifts only further away from . Further, for any there is a similar dilemma, where waiting comes for to move closer to comes with the risk of experiencing a positive jump taking (far) over the level to more unfavourable payoffs. So the structure of the solution is not very easy to guess.
Before presenting our main result we make two assumptions in addition to the conditions in (4), namely:
- (A1)
there exists such that , 2. (A2)
if has bounded variation then has no atoms.
Recall that (A1) is a restriction on the ‘large jumps’ in the sense that it is equivalent to
[TABLE]
(cf. Theorem 3.8 in [18]). It guarantees that the domain of (on the interior of which it is infinitely often differentiable and strictly convex) contains . In particular it implies that all the integer moments of are finite, and equals the -th cumulant of . Assumption (A2) is needed to exclude some pathological cases in the proofs.
Further recall that there exist families of scale functions denoted and for associated with , where for while on it is continuous, strictly increasing and uniquely characterised by
[TABLE]
and
[TABLE]
For simplicity we denote and . These scale functions are commonly used to express quantities involving one- and two-sided exit problems for , see e.g. Chapter 8 in [18]. Explicit expressions (or numerical algorithms) exist for many cases, cf. e.g. [15] (see also Section 4 below).
Here is our main result, which fully characterises the solution to the optimal stopping problem (8).
Theorem 2.5**.**
Consider the optimal stopping problem (8) for given by (10). Suppose that assumptions (A1) and (A2) above hold in addition to the conditions in (4). Further we denote for and the stopping time
[TABLE]
and we set
[TABLE]
We have the following two cases.
- (i)
If
[TABLE]
then for any it holds that is optimal in (8) and hence . 2. (ii)
If
[TABLE]
then there exists so that for any the stopping time is optimal in (8). A characterisation of is given in Lemma 3.4. Further is continuous and can be expressed as
[TABLE]
A proof is provided in Section 3. Case (i) is covered by Lemmas 3.5 & 3.12, while for case (ii) Lemmas 3.5 & 3.11 give the optimal stopping time and the expression for follows from Lemma 3.2.
This result shows that in both cases (i) and (ii), if the process starts in (i.e. ) then it is best to stop immediately. That is to say, it is not worth waiting for to decrease closer to due to the risk of it moving upwards rather. Further in case (ii), if the process starts in then it is optimal to wait until gets closer to and to stop only when it first enters . Note that it is indeed very well possible that (see also Section 4), in this situation it is optimal to stop when is close enough to rather than waiting until actually hits the level and risking that a positive jump takes (deep) into .
The distinction between the two cases in the result is also interesting. It can be verified that
[TABLE]
is non-negative, and that it vanishes if and only if has no jumps i.e. when is a Brownian motion with negative drift (cf. Lemma 3.1). Indeed, if has no jumps then neither has and therefore it is obvious that while lives in it is best to wait for it to hit (which it will a.s.). The above result confirms this since case (ii) always applies in this situation (with ). On the other hand, if does have jumps then has to be large enough (or: the difference between for close to [math] and has to be large enough) for the benefit of waiting for to get closer to to outweigh the risk of a jump taking (far) beyond .
Finally it is worth noting that we would expect that the above result remains valid under the weaker condition that only the first moment of is guarateed to be finite. It would then seem that the same two cases remain present as long as the second moment is also finite, but that when the second moment is infinite then (11) is also infinite due to and and hence only the first case is present. This is of course due to the quadratic form of the penalty function.
3 Remaining proofs
This section contains a proof of Theorem 2.5, broken down into a number of lemmas. We use the notation introduced above and in the statement of Theorem 2.5 throughout.
The proof is a bit hairy since the optimal stopping problem (8) involves a payoff function that is not monotone or convex/concave (often for payoff functions with such properties more straightforward arguments are possible) and further since a.s. as the integrability conditions that are typically assumed to formulate general results in optimal stopping theory do not hold in this case.
Recall that we are working under the assumption that the conditions in (4) hold, and that (A1) and (A2) from Section 2 hold. Using (A1), in the interior of the domain of , which contains the point [math], we get from (3) that
[TABLE]
Briefly returning to the scale functions introduced in Section 2, from Lemma 8.6 in [18] we know that if has unbounded variation and otherwise. Further, using (A2) we know that and on , and the right derivative in [math] exists which with a slight abuse of notation we denote by (cf. Lemma 8.2 and the discussion following it, and Exercise 8.5, both in [18]).
Further, for twice continuously differentiable functions we define
[TABLE]
If and are such that the integral in (13) is finite, Itô’s formula (cf. e.g. Theorem 4.3 in [18]) yields for all
[TABLE]
where is the Poisson random measure associated with the jumps of and
[TABLE]
By the Lévy-Itô decomposition the first integral in the expression for is a local martingale as its integrator is a martingale. Under the condition
[TABLE]
the Compensation Formula (see e.g. Theorems 4.3 & 4.4 and Corollary 4.6 in [18]) can be invoked to conclude that is a local martingale.
Now, the first three lemmas below make up some preparation.
Lemma 3.1**.**
The quantity
[TABLE]
vanishes when and is strictly positive otherwise.
Proof.
If then after some straightforward algebra we find that and, using (12), indeed that (15) vanishes. Now suppose that . From (12) it follows that i.e. is strictly concave, hence
[TABLE]
Further, using (12) to evaluate and simplifying somewhat using that yields
[TABLE]
Standard analysis shows that the integrand is strictly negative on and hence . Using this together with (16) yields
[TABLE]
and since the result indeed follows. ∎
Lemma 3.2**.**
For any , define the function as
[TABLE]
Then we have that
[TABLE]
where the function is given by
[TABLE]
for all .
Proof.
For any we have a.s. and hence the result is obvious. Next fix . Set
[TABLE]
From Theorem 8.10 in [18] we have that
[TABLE]
for all so that , which by (A1) holds on some open interval containing . Here and are the scale functions associated with after a change of measure, however using Lemma 8.4 in [18] we can simply write
[TABLE]
Plugging the expression for from (10) into (17) we find that we can write
[TABLE]
Now it is a matter of some tedious algebra to work this out using (18). Defining for notational convenience
[TABLE]
we can compute (also using that )
[TABLE]
and
[TABLE]
Further, also using that ,
[TABLE]
and
[TABLE]
Plugging all these elements back into (19) and simplifying a bit yields the result. ∎
Remark 3.3**.**
Theorem 8.10 in [18] uses the stopping time rather than to formulate (18). However for these stopping times are a.s. equal. Indeed, the event consists of paths of that first enter by hitting and then take a strictly positive amount of time after that to enter . The former behaviour requires that has unbounded variation (see Exercise 7.6 in [18]) while the latter requires that has bounded variation (see Theorem 6.5 in [18]).
Lemma 3.4**.**
Consider again the function defined in Lemma 3.2.
- (i)
If
[TABLE]
then on . 2. (ii)
If
[TABLE]
then has a unique root in denoted and we have that resp. on resp. .
Proof.
Note that we may write where
[TABLE]
Since , and we see that for and . Moreover, i.e. is strictly increasing.
If exists so that
[TABLE]
then, using that and
[TABLE]
It follows that has at most one root on .
For existence of a root we first show that
[TABLE]
For this, note that
[TABLE]
the final equality since as (recall that ) while from Theorems 8.1 & 3.12 in [18] we can deduce that
[TABLE]
Since for and is strictly increasing, (21) indeed follows.
It remains to look at for close to [math]. First consider the case that has unbounded variation. Then since and . Further, since and it follows that has a unique root on if and only if i.e. if and only if
[TABLE]
(indeed, if then on since is strictly increasing). If has bounded variation then where and hence we can again conclude that has a unique root on if and only if i.e. if and only if (22) holds. ∎
Now we are ready to start working towards the proof of Theorem 2.5. Note that it is obvious that as defined in (8) is bounded below by (since is) and that (by plugging into the right hand side of (8)).
Lemma 3.5**.**
Define the following regions in the state space of :
[TABLE]
Then for any the stopping time
[TABLE]
is optimal in (8), i.e. and are the continuation and stopping region respectively. Further is continuous.
Proof.
For continuity of , fix some . Let be a sequence so that as . Fix any . By definition of the infimum in (8) there exists a stopping time so that
[TABLE]
Note that since , this implies that
[TABLE]
and since and it also follows that a.s. Further, it is clear from the expression for that exists so that for all and hence it also follows that
[TABLE]
Now, for any we trivially have that
[TABLE]
Noting that can be bounded above by for some and that , an application of Taylor’s Theorem shows that
[TABLE]
Letting , since and recalling (24) we see that the ultimate rhs above vanishes and hence we find that
[TABLE]
We can now conclude that
[TABLE]
Since was arbitrary, it in fact follows that
[TABLE]
Finally, in a similar way it can be shown that
[TABLE]
and hence right continuity of in follows. Left continuity (provided that ) can be shown using analogue arguments.
It follows from Theorem 6 in [22] (recall that is non-negative) that
[TABLE]
is an optimal stopping time for (8). ∎
Remark 3.6**.**
Note that for any , since is spectrally negative its running supremum is a continuous process. In particular, on the time interval where
[TABLE]
it holds that and the filtrations generated by and coincide.
Lemma 3.7**.**
Fix any . Let be the process given by for all . Further define the stopping times
[TABLE]
We have the following.
- (i)
Suppose that
[TABLE]
Then the stopped process is a local submartingale. 2. (ii)
Next suppose that
[TABLE]
Then there exists (independent of ) such that the stopped process is a local submartingale.
(Recall Lemma 3.1 and that was defined in Lemma 3.4).
Proof.
Note that can be extended in a smooth way beyond [math] since . Let for notational convenience the function be given by . Applying the operator defined in (13) we have
[TABLE]
for . Using Taylor’s Theorem and the fact that is bounded it is easy to see that for some
[TABLE]
Again Taylor’s Theorem together with for some gives that
[TABLE]
where both integrals in the right hand side are finite on account of assumption (A1). Using the above two inequalities together with Fubini’s Theorem it follows that
[TABLE]
and hence we may write (cf. (14))
[TABLE]
where is a local martingale.
It remains to investigate the sign of . Plugging in the expression for from (10) yields
[TABLE]
Using that this simplifies to
[TABLE]
and further making use of (12) we can arrive at
[TABLE]
Also note that since and
[TABLE]
Now first consider case (i). In this case plugging in yields
[TABLE]
and hence for all . Since by definition of the process is bounded above by , the drift term in (27) is non-decreasing on and the result follows.
Next consider case (ii). Recalling Lemma 3.1 we now have that
[TABLE]
Further . Hence exists so that i.e.
[TABLE]
which confirms that is independent of . Since now for all the result follows analogue to above, it only remains to show that . The latter follows by observing that is identical to , where was defined in the proof of Lemma 3.4, and (cf. (20)). ∎
The next four lemmas are dedicated to fully fleshing out the case that
[TABLE]
Lemma 3.8**.**
Recall the stopping region as defined in Lemma 3.5 and as defined in Lemma 3.7. Under (28) there exists so that .
Proof.
First note that since attains its global minimum in it immediately follows that i.e. . Further since is continuous (cf. Lemma 3.5), is a closed set. It hence suffices to show that if and , then .
For this, using the same notation as in Lemma 3.7 and recalling Remark 3.6, note that
[TABLE]
and since
[TABLE]
Using as defined in Lemma 3.5 we can write
[TABLE]
Denote by the localising sequence of stopping times for the local submartingale from Lemma 3.7. Since , it follows from the Optional Sampling Theorem that for any , and
[TABLE]
Clearly for all large enough, attains its maximum on in , and a.s. So the rv in the left hand side of (30) is bounded above by which is integrable on account of Lemma 3.2, and hence by dominated convergence (30) remains valid for and . Next we can let and use monotone convergence to arrive at
[TABLE]
so that it follows from (29) that i.e. . ∎
Lemma 3.9**.**
Under (28), .
Proof.
Take any (with as defined in Lemma 3.7). We will show that so that indeed
[TABLE]
i.e. . For this, using the expression from Lemma 3.2 we can write
[TABLE]
Using the definition of from the proof of Lemma 3.4 and that we can further develop this as
[TABLE]
From Lemma 2.3 in [16] we know that
[TABLE]
where is the excursion measure of from its running supremum and is the height of a generic excursion. In particular is hence non-decreasing. Further, since on (cf. the proof of Lemma 3.4) and the integral in (31) is non-positive.
Now, if has bounded variation then (cf. the proof of Lemma 3.4) and hence it indeed follows from (31) that .
In the unbounded variation case we have (cf. the proof of Lemma 3.4) and we hence need to show that the integral in (31) is strictly negative. If this were not strictly negative then the integral would vanish, which since is non-decreasing is only possible when were equal to some constant on . However this simple ODE only admits for some as a positive solution, with and this is impossible since in the unbounded variation case. ∎
Lemma 3.10**.**
Under (28), .
Proof.
First consider the bounded variation case. For any it holds that
[TABLE]
where the first inequality is just by definition of and further we used Lemma 3.2. Since , and (cf. Lemma 3.4) it follows that i.e. .
Next we consider the unbounded variation case. We first show that , with as defined in Lemma 3.7. Fix . Pick some and , and define the stopping time
[TABLE]
Using that for any the process is strictly positive, we can use the same notation and decomposition as in Lemma 3.7 to write
[TABLE]
where is a local martingale whose localising sequence we denote by . By construction of we have for , and hence for any it follows from the Optional Sampling Theorem that . It follows that
[TABLE]
i.e. .
It remains to show that . If this were not true, then by virtue of Lemma 3.8 it must be the case that and that . However fix some . Then, using Lemma 3.2 together with , and (cf. Lemma 3.4)
[TABLE]
and hence for all small enough
[TABLE]
i.e. . However this contradicts with . ∎
Lemma 3.11**.**
Under (28), .
Proof.
From Lemmas 3.8, 3.9 & 3.10 it follows that for some , and hence for all . It remains to show that . Suppose that .
In the bounded variation case it follows that, using Lemma 3.2
[TABLE]
the inequality since and (cf. Lemma 3.4). But this contradicts .
In the unbounded variation case we can similarly use Lemma 3.2 to see that the left derivative at equals
[TABLE]
the inequality again using that and that . Combined with this again contradicts . ∎
It remains now to wrap up the other case in Theorem 2.5 i.e. that
[TABLE]
Lemma 3.12**.**
Under (32), .
Proof.
By the same arguments as in Lemma 3.8 we have that and that if then also . Hence for some . Using that now on (cf. Lemma 3.4), the same arguments as in Lemma 3.11 can be used to rule out . ∎
4 Some examples
We conclude by discussing some explicit examples. In the below, recall that the function was defined in Lemma 3.2. Further, in case (ii) of Theorem 2.5 we may write
[TABLE]
where is the unique root of the function (cf. Lemma 3.4). Since we have derived expressions for both and in terms of scale functions, for any spectrally negative Lévy process with known scale functions we also have explicit expressions for and , and a standard numerical root finding routine can be used to (approximately) compute .
First we consider the bounded variation spectrally negative Lévy process given by
[TABLE]
where , is a Poisson process with intensity and the ’s are iid with a common distribution for some . We assume so that the conditions in (4) hold.
It is well known (and easily verified) that
[TABLE]
Note that both assumptions (A1) and (A2) are satisfied, and that . Further it is well known (and again easily verified) that
[TABLE]
For the particular choices , , and we are in case (ii) of Theorem 2.5 and we can compute .
Figure 1 illustrates this situation, where the functions and for several values of are plotted, including . Of course, is dominated by every other . Note that each is constant for due to the fact that moves upwards by jumps only and that due to the lack of memory property of the Exponentially distributed jumps the overshoot over the level does not depend on the position just prior to the jump causing the overshoot. Further it is worth noting that is the only choice of that results in a continuous function, for the function experiences a discontinuity in . This phenomenon is well known in optimal stopping (for processes of bounded variation) and is usually referred to as ‘continuous fit’ or ‘continuous pasting’ (see e.g. [2]).
Next we add a Brownian motion to the above example to create a process of unbounded variation:
[TABLE]
It is again easily verified that (see also e.g. [16])
[TABLE]
and denoting the three distinct roots of by
[TABLE]
Choosing , , , and we are again in case (ii) of Theorem 2.5 and we can compute .
Figure 2 again shows plots of and for several values of . Noteworthy is that now all the ’s are continuous, and that distinguishes itself from for other values of via a fit to at rather than only a continuous fit. This is known as ‘smooth fit’ or ‘smooth pasting’ (see again [2] e.g.).
Remark 4.1**.**
It is worth noting that in Figures 1 & 2 the functions seem to have a vanishing derivative in . Indeed a bit of algebra with the expressions from Lemma 3.2 reveals that in general . This property is usually referred to as ‘normal reflection’ or ‘instantaneous reflection’ (see e.g. p. 264 in [19] or equation (3.32) in [12]) and naturally arises as follows. Using the strong Markov property it can be checked for any that
[TABLE]
i.e. that is martingale. (Note that the Snell envelope for our problem is contained in this family, for ). If the normal reflection property would not hold, then the (local) time accumulates at level [math] would destroy this martingale property. In a more pure free boundary approach to problems of this type normal reflection is typically included as one of the conditions imposed on the solution to the free boundary problem. However in the approach we have chosen in this paper, where in particular the proofs only consider processes that are stopped before hits the level [math], normal reflection appears here as a property of the solution rather than as a condition imposed on the solution.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Allaart, P. (2010) A general ‘bang-bang’ principle for predicting the maximum of a random walk. J. Appl. Probab. 47 , 1072–1083.
- 2[2] Alili, L. and Kyprianou, A. E. (2005) Some remarks on first passage of Lévy processes, the American put and pasting principles. Ann. Appl. Probab. 15(3) , 2062–2080.
- 3[3] Asmussen, S. and Albrecher, H. (2010) Ruin probabilities (Vol. 14). Singapore: World scientific .
- 4[4] Baurdoux, E. J. and Van Schaik, K. (2014) Predicting the time at which a Lévy process attains its ultimate supremum. Acta applicandae mathematicae 134(1) , 21–44.
- 5[5] Baurdoux, E. J., Kyprianou, A. E. and Ott, C. (2016) Optimal prediction for positive self-similar Markov processes. Electronic Journal of Probability 21 .
- 6[6] Bernyk, V. and Dalang, R. C. and Peskir, G. (2011) Predicting the Ultimate Supremum of a Stable Lévy Process with No Negative Jumps. Ann. Probab. 39 , 2385–2423.
- 7[7] Bertoin, J. (1996) Lévy Processes. Cambridge University Press .
- 8[8] Bichteler, K. (2002) Stochastic Integration with jumps. Cambridge University Press .
