Next Article in Journal
Optimization of Task-Scheduling Strategy in Edge Kubernetes Clusters Based on Deep Reinforcement Learning
Previous Article in Journal
The Robust Adaptive Control of Leader–Follower Formation in Mobile Robots with Dynamic Obstacle Avoidance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Closed-Form Solution of an Extraction Model and Optimal Stopping Problems with Regime Switching

1
School of Mathematics and Statistics, Northeastern University at Qinhuangdao, Taishan Road 143, Qinhuangdao 066004, China
2
School of Mathematical Sciences, Nankai University, Weijin Road 94, Tianjin 300071, China
3
Department of Mathematics, Zhejiang University, Yuhangtang Road 866, Hangzhou 310058, China
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(20), 4268; https://doi.org/10.3390/math11204268
Submission received: 12 September 2023 / Revised: 8 October 2023 / Accepted: 11 October 2023 / Published: 12 October 2023

Abstract

:
We aim to obtain by viscosity solution method the closed-form solution of a model concerning natural resource extraction in which a firm draws a schedule of when to stop the extraction. In this model, a regime-switching stochastic process is introduced to simulate the price of some natural resource. To solve the model, we first develop a theory, as a part of the results in the paper, that also applies to other optimal stopping problems containing regime-switching ingredients. Then using the theory, we solve the model completely and rigorously. A numerical example is given to display the results of the model.
MSC:
60G40; 91B06

1. Introduction

Natural resource extraction has received a lot of attention due to its relevance to many issues. Ma et al. [1] and Liu [2] discussed the impact of natural resource extraction on the COP26 target, Alhassan and Kwakwa [3] and Teng [4] examined the effect of natural resource extraction on environmental sustainability, Dadasov et al. [5] studied the relationship of natural resource extraction with corruption and expropriation, and Thorsten [6] researched the role of natural resource extraction in civil conflict.
Therefore, people modeled natural resource extraction from various different perspectives. Bella [7] gave a natural resource extraction model to study the presence of closed orbits that signal economic fluctuations and periodic solutions around the steady state. Engel and Fischer [8] discussed resource extraction contracts in the setting that developing countries need foreign investment in order to develop their natural resources. Under different assumptions on the price of resources, numerous authors [9,10,11] studied when it is optimal to stop the extraction, where the price process and payoff are not regime switching. Ferrari and Yang [12] assumed that the price process follows Bachelier model [13] with regime switching. As Samuelson [14] has pointed out, geometric Brownian motion rather than the Bachelier model is good for describing the price process. In the present paper, we use a regime-switching geometric Brownian motion to simulate the price process.
We state our natural resource extraction model. A firm is extracting a kind of natural resource (oil, gas, etc.). We are interested in determining what time is optimal to stop the extraction.
Let ( Ω , F , { F t } t 0 , P ) be a filtered probability space. We assume that { F t } t 0 satisfies the usual conditions and F 0 is the completion of { , Ω } .
Let ( X ( t ) , t 0 ) be a time-homogeneous Markov chain defined on ( Ω , F , { F t } t 0 , P ) taking values in { 1 , 2 } , with a rate matrix A : = λ 1 λ 2 λ 1 λ 2 for some positive constants λ 1 , λ 2 . As usual, we denote by X i the Markov chain if it starts from i at time t = 0 .
Let ( B ( t ) , t 0 ) be a one-dimensional standard Brownian motion, which is independent of X, defined on ( Ω , F , { F t } t 0 , P ) .
We assume that the price process P i , p of the resource is the solution to
d P ( t ) = μ ( X i ( t ) ) P ( t ) d t + σ ( X i ( t ) ) P ( t ) d B ( t ) , P ( 0 ) = p > 0 ,
where μ ( 1 ) : = μ 1 , μ ( 2 ) : = μ 2 , σ ( 1 ) : = σ 1 and σ ( 2 ) : = σ 2 for some constants μ i and σ i , i = 1 , 2 . Without loss of generality, we will assume that μ 1 μ 2 , and σ 1 , σ 2 > 0 . That is to say, the regime for the small drift is named 1, and the volatilities are of course positive.
Applying Itô’s formula [15] (p. 149, Theorem 3.3), we deduce that
P i , p ( t ) = p exp 0 t μ ( X i ( s ) ) 1 2 σ ( X i ( s ) ) 2 d s + 0 t σ ( X i ( s ) ) d B ( s ) .
To answer the question of what time is optimal to stop the extraction, we will solve the following optimal problem:
J i ( p ) : = J ( i , p ) : = sup τ T E 0 τ exp ( r t ) ( P i , p ( t ) C ) d t exp ( r τ ) K ,
where T is the collection of all stopping times with respect to { F t } t 0 , r > 0 is the discount rate, C > 0 is the running cost rate, and K is the cost at which the firm stops the extraction. Problems like problem (3) are called optimal problems [16] (p. 96). Problem (3) is solved in Theorems 6, 7, and 8.
Regime-switching processes like (1) are plausible choices of modelling the price processes in many situations such as commodities [17] and financial assets [18,19]. Thus, it is a reasonable choice that we use process (1) to approximate the price of some natural resource.
Assuming the underlying process is governed by a regime-switching geometric Brownian motion, the authors of [20,21,22,23] solved some specific optimal stopping problems which do not involve integral parts by guessing a priori a strategy and then validated it by a verification argument.Under the same assumption, Pemy [24] used the viscosity solution technique to solve American options and selling rules. However, he did not discuss the regularity of the value function, and the forms of optimal stopping intervals are known in advance. Liu claimed in [25] (Theorem 2) that the value function is the unique viscosity solution to some variational inequalities. The research in [25] (Theorem 2) seems not to require any more conditions, but, if checking the proof carefully, we find a crucial condition β > 6 K is needed, and this condition brings great inconvenience and is too restrictive in practice. In particular, the numerical example in [25] invalidates the condition β > 6 K . In the application part of [25], the variational inequality (4.3) in [25] is defined on ( 0 , + ) , not on R ; however, the author did not impose boundary conditions. Also, in the application part, the author did not provide any reasons why the exercise time takes the form shown in the paper.
In this paper, we develop a complete general theory and then use it to solve problem (3). We discuss the effect of all the parameters on the optimal decision. It will be seen that an investor may never stop in some regimes; however, the investor should stop within a finite time horizon as an optimal choice if the investor considers all the possible regimes. The numerical Example 2 demonstrates this phenomenon visually.
We outline the structure of this paper. In Section 2, we examine the regularity of the value function (Theorem 3), optimal stopping strategies (Theorem 4), and forms of optimal stopping intervals (Theorem 5) in a general setting. In Section 3, we solve problem (3) using the results obtained in Section 2. Some conclusions are drawn in Section 4.

2. Preliminaries

We leave the specific problem (3) temporarily, but focus on a general case.
We allow the Markov chain ( X ( t ) , t 0 ) to take values in I : = { 1 , 2 , , m } , which may start from any element of I at time t = 0 , whose rate matrix is A : = ( a i j ) m × m with a i i < 0 , for each i = 1 , 2 , , m , and then generalize (1) to the equation
d Y ( t ) = α ( X i ( t ) , Y ( t ) ) d t + β ( X i ( t ) , Y ( t ) ) d B ( t ) , Y ( 0 ) = y ,
where α : I × R R and β : I × R R are two functions such that α ( i , · ) and β ( i , · ) are Lipschitz continuous for each i = 1 , 2 , , m . We assume that β ( · , · ) > 0 .
Let Y i , y be the solution to Equation (4). In order to solve problem (3), we intend to solve the optimal stopping problem
V ( i , y ) : = sup τ T E [ 0 τ exp ( r t ) f ( X i ( t ) , Y i , y ( t ) ) d t + exp ( r τ ) g ( X i ( τ ) , Y i , y ( τ ) ) ] ,
where f : I × R R and g : I × R R are two functions such that f ( i , · ) and g ( i , · ) are Lipschitz continuous for each i = 1 , 2 , , m . We use the convention exp ( r τ ) g ( X ( τ ) , Y ( τ ) ) = 0 on { τ = } since r > 0 and g ( i , · ) are Lipschitz continuous.
For each i = 1 , 2 , , m , set α i ( · ) : = α ( i , · ) , β i ( · ) : = β ( i , · ) , f i ( · ) : = f ( i , · ) , g i ( · ) : = g ( i , · ) , and V i ( · ) : = V ( i , · ) .
We have Theorem 1 showing the viscosity solution property of V, and Theorem 2 telling us the uniqueness of viscosity solutions.
Theorem 1
([26] (Theorem 1)). If
(H1)
the functions V i ’s are continuous and grow at most linearly,
then for each fixed i { 1 , 2 , , m } , V i is the unique viscosity solution with at most linear growth to the following variational inequality:
min r V i L i V i q = 1 m a q i V q f i , V i g i = 0 on R ,
where L i is defined by L i ξ ( y ) : = 1 2 β i ( y ) 2 2 ξ ( y ) y 2 + α i ( y ) ξ ( y ) y for any ξ C 2 ( R ) .
Theorem 2
([26] (Theorem 2)). Assume that
(H2)
there are positive numbers b i ’s such that i = 1 m b i h i j ( λ ¯ ) 0 for some constant λ ¯ > 1 , j = 1 , 2 , , m . Here h i j ( λ ) : = a i j for i j , and h i i ( λ ) : = r a i i μ i λ 1 2 σ i 2 λ ( λ 1 ) with μ i : = lim sup x α i ( x ) x and σ i : = lim sup x β i ( x ) x .
Let { U i } i = 1 m be a family of functions defined on R with at most linear growth such that for each fixed i, U i is a viscosity solution to
min r U i L i U i q = 1 m a q i U q f i , U i g i = 0 on R .
Let { W i } i = 1 m be another family of functions defined on R with the same properties as those of { U i } i = 1 m . Then U i = W i for i = 1 , 2 , , m .
Let us introduce some notations as follows.
C i : = { y : V i ( y ) > g i ( y ) } , S i : = { y : V i ( y ) = g i ( y ) } ,
D i : = { y : r g i ( y ) L i g i ( y ) q = 1 m a q i g q ( y ) f i ( y ) 0 } ,
and
V ^ i ( y ) : = E 0 exp ( r t ) f ( X i ( t ) , Y i , y ( t ) ) d t ,
for each i = 1 , 2 , , m .
We consider the regularity of V in the following theorem.
Theorem 3.
Assume that (H1) holds. Then the function V i is C 2 continuous on C i , i = 1 , 2 , , m . If, furthermore, g i is C 1 continuous, then V i is C 1 continuous on C i .
Proof. 
Fix an i { 1 , 2 , , m } . By redefining the discount rate, payoff functions, and underlying process, the function V i is also the value function of a classical optimal stopping problem
sup τ T E [ 0 τ exp ( ( r a i i ) t ) f i ( Z z ( t ) ) + q i a q i V q ( Z z ( t ) ) d t + exp ( r τ ) g i ( Z z ( τ ) ) ] ,
where Z z is the solution to d Z ( t ) = α i ( Z ( t ) ) d t + β i ( Z ( t ) ) d B ( t ) along with Z ( 0 ) = z R , and (6) is also the variational inequality of this new optimal stopping problem. It follows from β ( · , · ) > 0 that L i is uniformly elliptic on any bounded closed domain of C i , i = 1 , 2 , , m . Then, thanks to Theorem 1, we complete the proof by [16] (p. 100, Lemma 5.2.2 and Proposition 5.2.1). □
Theorem 4 provides an optimal stopping strategy for the problem (5).
Theorem 4.
Assume that (H1) holds. Then the stopping time τ * : = inf { t > 0 : ( X ( t ) , Y ( t ) ) i = 1 m { i } × S i } is an optimal stopping time of the problem (5).
Proof. 
We refer to [16] (pp. 101–102) for the proof. □
Lemma 1 states some properties about S i ’s and will be used to study the forms of S i ’s in Theorem 5.
Lemma 1.
Assume that (H1) and (H2) hold. Then the following conclusions are true.
(a) 
If i = 1 m S i = , then V ^ i g i for each i = 1 , 2 , , m .
(b) 
If V ^ i g i for each i = 1 , 2 , , m , then V i = V ^ i .
(c) 
If g i is C 2 continuous for some i { 1 , 2 , , m } , then S i is included in D i .
Proof. 
By virtue of Theorem 2, (a) and (b) are proved in a similar way to that of [16] (p. 102, Lemma 5.2.3); for the proof of (c), we apply Theorem 2 and refer to [16] (p. 102, Lemma 5.2.4). □
Now we study the forms of S i ’s. To do this, we make the following assumption.
(H1′)
The functions V i ’s are Lipschitz continuous. Then it is reasonable to set V i ( 0 ) : = V i ( 0 + ) .
(H3)
The process Y takes values in ( 0 , + ) and | α i ( y ) | + | β i ( y ) | C | y | for some constant C, i = 1 , 2 , , m .
We will use the fact that the matrix r I m × m ( a i j ) m × m is invertible. This follows from the fact that r I m × m ( a i j ) m × m is a strictly diagonally dominant matrix, since r > 0 and i = 1 m a i j = 0 for all j = 1 , 2 , , m . Let ( b i j ) m × m denote the inverse of r I m × m ( a i j ) m × m .
Lemma 2.
Assume that (H1′) and (H3) hold. Then
(a) 
If q = 1 m b q i f q ( 0 ) g i ( 0 ) , i = 1 , 2 , , m , then V i ( 0 ) = q = 1 m b q i f q ( 0 ) .
(b) 
If r g i ( 0 ) q = 1 m a q i g q ( 0 ) f i ( 0 ) 0 , i = 1 , 2 , , m , then V i ( 0 ) = g i ( 0 ) .
Proof. 
By taking limits as y 0 + , Theorem 1 implies that V i ( 0 ) is a solution to
min r V i ( 0 ) q = 1 m a q i V q ( 0 ) f i ( 0 ) , V i ( 0 ) g i ( 0 ) = 0 .
The conclusions follow from the above equations. □
Theorem 5.
Assume that (H1), (H2), and (H3) hold, S i ’s are nonempty connected sets, and g i ’s are C 2 continuous. Then the following are true.
(a) 
If D i = [ a i , + ) for some positive constant a i , i = 1 , 2 , , m , then S i = [ inf S i , + ) .
(b) 
If r g i ( 0 ) q = 1 m a q i g q ( 0 ) f i ( 0 ) 0 and D i = ( 0 , b i ] for some positive constant b i , i = 1 , 2 , , m , then S i = ( 0 , sup S i ] .
Proof. 
Set a i * : = inf S i in Case (a) and b i * : = sup S i in Case (b). Then we define A i : = [ a i * , + ) in Case (a) and A i : = ( 0 , b i * ] in Case (b). We will prove S i = A i .
Note the following facts:
-
g i ’s grow at most linearly;
-
g i ( a i * ) = V i ( a i * ) or g i ( b i * ) = V i ( b i * ) by the continuity of g i and V i ;
-
in light of Lemma 2, g i ( 0 ) = V i ( 0 ) if r g i ( 0 ) q = 1 m a q i g q ( 0 ) f i ( 0 ) 0 .
Moreover, thanks to A i D i by Lemma 1, g i solves the inequality r g i L i g i q = 1 m a q i g q f i 0 on A i . Thus, by Theorem 2, it follows that g i = V i on A i . The proof is complete. □

3. The Solution to Problem (3)

We apply the results obtained in Section 2 to solve problem (3).
Lemma 3
([22] (Lemma 1)). We have
E exp 0 t μ ( X i ( s ) ) d s = x 2 μ i x 2 x 1 exp ( x 1 t ) + μ i x 1 x 2 x 1 exp ( x 2 t ) ,
where x 1 and x 2 are the solutions to the quadratic equation x 2 + ( λ 1 μ 1 + λ 2 μ 2 ) x + ( λ 1 μ 1 ) ( λ 2 μ 2 ) λ 1 λ 2 = 0 with x 1 < x 2 .
Remark 1.
If μ 1 < μ 2 , then x 1 < μ 1 < x 2 < μ 2 ; if μ 1 = μ 2 , then x 1 = μ 1 λ 1 λ 2 and x 2 = μ 1 .
Theorem 6.
Assume r x 2 . Then the optimal stopping time τ * is given by τ * = + a.s., and the function J i in (3) is given by J i ( p ) = + , i = 1 , 2 .
Proof. 
By (2) and (3), we have, for fixed T > 0 ,
J i ( p ) p 0 T E exp ( r t ) exp 0 t μ ( X i ( s ) ) 1 2 σ ( X i ( s ) ) 2 d s + 0 t σ ( X i ( s ) ) d B ( s ) d t r 1 ( 1 exp ( r T ) ) C exp ( r T ) K .
Note that
exp 0 t σ ( X i ( s ) ) d B ( s ) 1 2 0 t σ ( X i ( s ) ) 2 d s ) , t 0
is a martingale. Then in light of the independence of X and B, we obtain
J i ( p ) p 0 T exp ( r t ) E exp 0 t μ ( X i ( s ) ) d s d t r 1 ( 1 exp ( r T ) ) C exp ( r T ) K = p x 2 μ i x 2 x 1 0 T exp ( ( x 1 r ) t ) d t + μ i x 1 x 2 x 1 0 T exp ( ( x 2 r ) t ) d t r 1 ( 1 exp ( r T ) ) C exp ( r T ) K ,
where we have used Lemma 3.
Sending T + in the above inequality, we obtain J i ( p ) = + since r x 2 . □
Corollary 1.
If r μ 1 , then the conclusions in Theorem 6 hold.
Proof. 
The proof can be completed by the fact that r μ 1 implies r x 2 . □
Example 1.
Take μ 1 = 0.02 , μ 2 = 0.20 , σ 1 = 0.1 , σ 2 = 0.05 , r = 0.05 , λ 1 = 0.2 , λ 2 = 0.5 . Then we have r = 0.05 < 0.0819 = x 2 . Thus, we apply Theorem 6, and find that the firm should never stop the extraction.
In the following discussion, we consider the case r > x 2 .
Lemma 4.
(a) Remark 2.1 [20] The following equation w 1 ( z ) w 2 ( z ) λ 1 λ 2 = 0 , where w i ( z ) : = r + λ i μ i z σ i 2 2 z ( z 1 ) , has four distinct solutions z i ’s satisfying z 1 < z 2 < 0 < z 3 < z 4 with w 1 ( z 3 ) > 0 .
(b) Assume that r > x 2 . Then z 3 > 1 and there are positive constants b i ’s fulfilling b 1 w 1 ( z 3 ) λ 1 b 2 = 0 and b 2 w 2 ( z 3 ) λ 2 b 1 = 0 . See Figure 1.
Proof. 
1. Set Q ( z ) : = w 1 ( z ) w 2 ( z ) λ 1 λ 2 . Note that the equation w 1 ( z ) = 0 has two solutions, say, z 1 and z 2 with z 1 < z 2 . Then Q ( z i ) < 0 , where i = 1 , 2 . In addition, we have Q ( 0 ) > 0 and lim z Q ( z ) = + . Therefore, by the intermediate value theorem, it follows that the equation w 1 ( z ) w 2 ( z ) λ 1 λ 2 = 0 has four distinct solutions z i ’s satisfying z 1 < z 2 < 0 < z 3 < z 4 . Furthermore, w 1 ( z 3 ) > 0 , since z 1 < z 3 < z 2 .
2. Since r > x 2 , we have
r 2 + ( λ 1 μ 1 + λ 2 μ 2 ) r + ( λ 1 μ 1 ) ( λ 2 μ 2 ) λ 1 λ 2 > 0
and
2 r + λ 1 μ 1 + λ 2 μ 2 > 0 .
Then it follows from (7) that Q ( 1 ) > 0 and ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) > 0 . Combining (8) and ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) > 0 , we have r + λ 1 μ 1 > 0 and r + λ 2 μ 2 > 0 .
3. In this step, we prove z 3 > 1 .
Case 1  μ i + σ i 2 / 2 > 0 , where i = 1 , 2 . In this case, we have
Q ( 1 ) = ( r + λ 1 μ 1 ) ( μ 2 + σ 2 2 / 2 ) ( r + λ 2 μ 2 ) ( μ 1 + σ 1 2 / 2 ) < 0 .
This and Q ( 1 ) > 0 imply z 3 > 1 .
Case 2  μ i + σ i 2 / 2 < 0 , where i = 1 , 2 . In this case, we have
Q ( 1 ) = 3 σ 1 2 σ 2 2 + 3 ( σ 1 2 μ 2 + σ 2 2 μ 1 ) < 0 .
This and Q ( 1 ) > 0 imply z 3 > 1 .
Case 3  ( μ 1 + σ 1 2 / 2 ) ( μ 2 + σ 2 2 / 2 ) 0 . In this case, we have
Q ( 1 ) = σ 1 2 ( r + λ 2 μ 2 ) + 2 ( μ 1 + σ 1 2 2 ) ( μ 2 + σ 2 2 2 ) σ 1 2 ( r + λ 2 μ 2 ) < 0 .
This and Q ( 1 ) > 0 imply z 3 > 1 .
4. Take b 1 = 1 and b 2 = w 1 ( z 3 ) / λ 1 . Then we have b 1 w 1 ( z 3 ) λ 1 b 2 = 0 and b 2 w 2 ( z 3 ) λ 2 b 1 = 0 . □
Lemma 5.
Assume that r > x 2 . Then J i is a Lipschitz continuous function, i = 1 , 2 . In addition, S i : = { p : p ( 0 , + ) and J i ( p ) = K } is connected, i = 1 , 2 .
Proof. 
1. By (2) and (3), we have
| J i ( p 1 ) J i ( p 2 ) | | p 1 p 2 | 0 + E exp ( r t ) exp 0 t μ ( X i ( s ) ) 1 2 σ ( X i ( s ) ) 2 d s + 0 t σ ( X i ( s ) ) d B ( s ) d t .
Note that
exp 0 t σ ( X i ( s ) ) d B ( s ) 1 2 0 t σ ( X i ( s ) ) 2 d s ) , t 0
is a martingale. Then in light of the independence of X and B, we obtain
| J i ( p 1 ) J i ( p 2 ) | | p 1 p 2 | 0 + exp ( r t ) E exp 0 t μ ( X i ( s ) ) d s d t = 1 x 2 x 1 · x 2 μ i r x 1 + μ i x 1 r x 2 | p 1 p 2 | ,
where we have used Lemma 3 and r > x 2 for the equality.
2. We prove that S i : = { p : p ( 0 , + ) and J i ( p ) = K } is connected by contradiction. Suppose that a , b S i but there is a point c ( a , b ) with c S i (i.e., J i ( c ) > K ).
Noting that J i is convex, we have
J i ( c ) b c b a J i ( a ) + c a b a J i ( b ) = K ,
which contradicts J i ( c ) > K . □
Lemma 6.
Assume r > x 2 . Then { J 1 , J 2 } is the unique solution with at most linear growth of the following variational inequalities:
min { ( r + λ 1 ) J 1 ( p ) μ 1 p J 1 ( p ) 1 2 σ 1 2 p 2 J 1 ( p ) λ 1 J 2 ( p ) p + C , J 1 ( p ) + K } = 0 min { ( r + λ 2 ) J 2 ( p ) μ 2 p J 2 ( p ) 1 2 σ 2 2 p 2 J 2 ( p ) λ 2 J 1 ( p ) p + C , J 2 ( p ) + K } = 0
with boundary condition J i ( 0 ) = min { C / r , K } , i = 1 , 2 , on ( 0 , + ) in the viscosity sense.
Proof. 
The boundary condition J i ( 0 ) = min { C / r , K } , i = 1 , 2 , can be obtained by (2) and (3). In fact,
J i ( 0 ) = sup τ T E 0 τ exp ( r t ) ( C ) d t exp ( r τ ) K = C r + sup τ T E exp ( r τ ) C r K = min C r , K .
Then, by Lemmas 4 and 5, the result is a straight corollary of Theorem 2. □
Theorem 7.
Assume that r > x 2 and C r K . Then the optimal stopping time τ * is given by τ * = + a.s.; furthermore, the functions J i ’s are given by
J 1 ( p ) = k 2 p r 1 C , J 2 ( p ) = k 1 p r 1 C ,
where
k i = r + λ 1 + λ 2 μ i ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 , i = 1 , 2 .
Proof. 
Note that, for i = 1 , 2 , S i { p : 0 < p C r K } by Lemma 1. Thus, we have S i = .
Therefore, it follows from Lemma 6 that
J 1 ( p ) = ( r + λ 1 + λ 2 μ 2 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r
and
J 2 ( p ) = ( r + λ 1 + λ 2 μ 1 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r .
The proof is complete. □
Corollary 2.
If r > μ 2 and C r K , then the conclusions in Theorem 7 hold.
Proof. 
The proof can be completed by the fact that r > μ 2 implies r > x 2 . □
Recall that z 1 and z 2 are the solutions to w 1 ( z ) w 2 ( z ) λ 1 λ 2 = 0 with z 1 < z 2 < 0 (see Lemma 4).
Theorem 8.
Assume that r > x 2 and C > r K . Then one and only one of the following holds.
(a) The equation
p 1 y 1 0 0 p 1 y 2 a 11 p 1 + b 11 a 21 p 1 + b 21 = p 2 y 1 0 0 p 2 y 2 a 12 p 2 + b 12 a 22 p 2 + b 22
has a solution { p 1 * , p 2 * } with p 1 * < p 2 * , where y 1 and y 2 are the two solutions to the quadratic equation r + λ 1 μ 1 y 1 2 σ 1 2 y ( y 1 ) = 0 with y 1 < y 2 ,
a 11 a 21 = 1 1 y 1 y 2 1 1 r + λ 1 μ 1 1 r + λ 1 μ 1 , b 11 b 12 = 1 1 y 1 y 2 1 C r K r + λ 1 0 ,
a 12 a 22 = 1 1 y 1 y 2 1 k 2 1 r + λ 1 μ 1 k 2 1 r + λ 1 μ 1 λ 1 1 1 z 1 z 2 w 1 ( z 1 ) w 1 ( z 2 ) w 1 ( z 1 ) z 1 w 1 ( z 2 ) z 2 1 k 1 k 1 ,
and
b 12 b 22 = 1 1 y 1 y 2 1 λ 1 K + C r + λ 1 C r 0 + λ 1 1 1 z 1 z 2 w 1 ( z 1 ) w 1 ( z 2 ) w 1 ( z 1 ) z 1 w 1 ( z 2 ) z 2 1 C r K r 0 .
In addition, the optimal stopping time τ * is given by
τ * = inf { t : t > 0 , ( X ( t ) , P ( t ) ) { 1 } × ( 0 , p 1 * ] { 2 } × ( 0 , p 2 * ] } ,
and the J i ’s are given by
J 1 ( p ) = K on ( 0 , p 1 * ] p r + λ 1 μ 1 λ 1 K + C r + λ 1 + A 1 p y 1 + A 2 p y 2 on ( p 1 * , p 2 * ] k 2 p r 1 C + B 1 p z 1 + B 2 p z 2 on ( p 2 * , + )
and
J 2 ( p ) = K on ( 0 , p 2 * ] k 1 p r 1 C + λ 1 1 w 1 ( z 1 ) B 1 p z 1 + λ 1 1 w 1 ( z 2 ) B 2 p z 2 on ( p 2 * , + ) ,
respectively. Here
A 1 A 2 = p 1 * y 1 0 0 p 1 * y 2 a 11 p 1 * + b 11 a 21 p 1 * + b 21 ,
B 1 B 2 = λ 1 p 2 * z 1 0 0 p 2 * z 2 w 1 ( z 1 ) w 1 ( z 2 ) w 1 ( z 1 ) z 1 w 1 ( z 2 ) z 2 1 k 1 p 2 * + C r K r k 1 p 2 * .
(b) The equation
p 2 y ¯ 1 0 0 p 2 y ¯ 2 a ¯ 11 p 2 + b ¯ 11 a ¯ 21 p 2 + b ¯ 21 = p 1 y ¯ 1 0 0 p 1 y ¯ 2 a ¯ 12 p 1 + b ¯ 12 a ¯ 22 p 1 + b ¯ 22
has a solution { p ¯ 1 * , p ¯ 2 * } with p ¯ 1 * > p ¯ 2 * , where y ¯ 1 and y ¯ 2 are the two solutions to the quadratic equation r + λ 2 μ 2 y 1 2 σ 2 2 y ( y 1 ) = 0 with y ¯ 1 < y ¯ 2 ,
a ¯ 11 a ¯ 21 = 1 1 y ¯ 1 y ¯ 2 1 1 r + λ 2 μ 2 1 r + λ 2 μ 2 , b ¯ 11 b ¯ 12 = 1 1 y ¯ 1 y ¯ 2 1 C r K r + λ 2 0 ,
a ¯ 12 a ¯ 22 = 1 1 y ¯ 1 y ¯ 2 1 k 1 1 r + λ 2 μ 2 k 1 1 r + λ 2 μ 2 λ 2 1 1 z 1 z 2 w 2 ( z 1 ) w 2 ( z 2 ) w 2 ( z 1 ) z 1 w 2 ( z 2 ) z 2 1 k 2 k 2 ,
and
b ¯ 12 b ¯ 22 = 1 1 y ¯ 1 y ¯ 2 1 λ 2 K + C r + λ 2 C r 0 + λ 2 1 1 z 1 z 2 w 2 ( z 1 ) w 2 ( z 2 ) w 2 ( z 1 ) z 1 w 2 ( z 2 ) z 2 1 C r K r 0 .
In addition, the optimal stopping time τ * is given by
τ * = inf { t : t > 0 , ( X ( t ) , P ( t ) ) { 1 } × ( 0 , p ¯ 1 * ] { 2 } × ( 0 , p ¯ 2 * ] } ,
and the J i ’s are given by
J 1 ( p ) = K on ( 0 , p ¯ 1 * ] k 2 p r 1 C + λ 2 1 w 2 ( z 1 ) B ¯ 1 p z 1 + λ 2 1 w 2 ( z 2 ) B ¯ 2 p z 2 on ( p ¯ 1 * , + )
and
J 2 ( p ) = K on ( 0 , p ¯ 2 * ] p r + λ 2 μ 2 λ 2 K + C r + λ 2 + A ¯ 1 p y ¯ 1 + A ¯ 2 p y ¯ 2 on ( p ¯ 2 * , p ¯ 1 * ] k 1 p r 1 C + B ¯ 1 p z 1 + B ¯ 2 p z 2 on ( p ¯ 1 * , + ) ,
respectively. Here
A ¯ 1 A ¯ 2 = p ¯ 2 * y 1 0 0 p ¯ 2 * y 2 a ¯ 11 p ¯ 1 * + b ¯ 11 a ¯ 21 p ¯ 1 * + b ¯ 21 ,
B ¯ 1 B ¯ 2 = λ 2 p ¯ 1 * z 1 0 0 p ¯ 1 * z 2 w 2 ( z 1 ) w 2 ( z 2 ) w 2 ( z 1 ) z 1 w 2 ( z 2 ) z 2 1 k 2 p ¯ 1 * + C r K r k 2 p ¯ 1 * .
(c) The equation
a ˜ 11 p + b ˜ 11 a ˜ 21 p + b ˜ 21 = a ˜ 12 p + b ˜ 12 a ˜ 22 p + b ˜ 22
has a positive solution p * , where
a ˜ 11 a ˜ 12 = 1 1 z 1 z 2 1 k 2 k 2 , b ˜ 11 b ˜ 12 = 1 1 z 1 z 2 1 C r K r 0 ,
a ˜ 12 a ˜ 22 = λ 1 w 1 ( z 1 ) w 1 ( z 2 ) w 1 ( z 1 ) z 1 w 1 ( z 2 ) z 2 1 k 1 k 1 ,
and
b ˜ 12 b ˜ 22 = λ 1 w 1 ( z 1 ) w 1 ( z 2 ) w 1 ( z 1 ) z 1 w 1 ( z 2 ) z 2 1 C r K r 0 .
In addition, the optimal stopping time τ * is given by
τ * = inf { t : t > 0 , P ( t ) ( 0 , p * ] } ,
and the J i ’s are given by
J 1 ( p ) = K on ( 0 , p * ] k 2 p r 1 C + B ˜ 1 p z 1 + B ˜ 2 p z 2 on ( p * , + )
and
J 2 ( p ) = K on ( 0 , p * ] k 1 p r 1 C + λ 1 1 w 1 ( z 1 ) B ˜ 1 p z 1 + λ 1 1 w 1 ( z 2 ) B ˜ 2 p z 2 on ( p * , + ) ,
respectively. Here
B ˜ 1 B ˜ 2 = p * z 1 0 0 p * z 2 a ˜ 11 p * + b ˜ 11 a ˜ 21 p * + b ˜ 21 .
Proof. 
1. If S i = , we have
J i ( p ) : = E 0 + exp ( r t ) ( P i , p ( t ) C ) d t .
In particular, J i ( 0 ) = C / r , but Lemma 6 tells us that J i ( 0 ) = K because of C > r K . This contradiction leads to S i . In addition, the condition r g i ( 0 ) q = 1 m a q i g q ( 0 ) f i ( 0 ) 0 in Theorem 5 is equivalent to C r K , and we have D i = ( 0 , C r K ] . Therefore, by Theorem 5 and Lemma 5, it follows that S i = ( 0 , p i * ] for some positive number p i * .
2. Case 1  p 1 * < p 2 * . In this case, by Lemma 6, we have
J 1 ( p ) = K J 2 ( p ) = K
on ( 0 , p 1 * ] ,
( r + λ 1 ) J 1 ( p ) μ 1 p J 1 ( p ) 1 2 σ 1 2 p 2 J 1 ( p ) λ 1 J 2 ( p ) p + C = 0 J 2 ( p ) = K
on ( p 1 * , p 2 * ] , and
( r + λ 1 ) J 1 ( p ) μ 1 p J 1 ( p ) 1 2 σ 1 2 p 2 J 1 ( p ) λ 1 J 2 ( p ) p + C = 0 ( r + λ 2 ) J 2 ( p ) μ 2 p J 2 ( p ) 1 2 σ 2 2 p 2 J 2 ( p ) λ 2 J 1 ( p ) p + C = 0
on ( p 2 * , + ) .
Note that r + λ 1 μ 1 > 0 by Step 2 of the proof of Lemma 4. We have by (9)
J 1 ( p ) = p r + λ 1 μ 1 λ 1 K + C r + λ 1 + A 1 p y 1 + A 2 p y 2 on ( p 1 * , p 2 * ] ,
where A 1 and A 2 are two constants, and y 1 and y 2 are the two solutions to the quadratic equation r + λ 1 μ 1 y 1 2 σ 1 2 y ( y 1 ) = 0 with y 1 < y 2 .
Since J 1 and J 2 are Lipschitz continuous, we have by (10)
J 1 ( p ) = ( r + λ 1 + λ 2 μ 2 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + B 1 p z 1 + B 2 p z 2 J 2 ( p ) = ( r + λ 1 + λ 2 μ 1 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + λ 1 1 w 1 ( z 1 ) B 1 p z 1 + λ 1 1 w 1 ( z 2 ) B 2 p z 2
on ( p 2 * , + ) , where B 1 and B 2 are some constants, and z 1 and z 2 are the solutions introduced in Lemma 4.
Therefore, by C 1 continuity of J 1 and J 2 , we have
p 1 * r + λ 1 μ 1 λ 1 K + C r + λ 1 + A 1 p 1 * y 1 + A 2 p 1 * y 2 = K 1 r + λ 1 μ 1 + A 1 y 1 p 1 * y 1 1 + A 2 y 2 p 1 * y 2 1 = 0 ,
p 2 * r + λ 1 μ 1 λ 1 K + C r + λ 1 + A 1 p 2 * y 1 + A 2 p 2 * y 2 = ( r + λ 1 + λ 2 μ 2 ) p 2 * ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + B 1 p 2 * z 1 + B 2 p 2 * z 2 1 r + λ 1 μ 1 + A 1 y 1 p 2 * y 1 1 + A 2 y 2 p 2 * y 2 1 = r + λ 1 + λ 2 μ 2 ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 + B 1 z 1 p 2 * z 1 1 + B 2 z 2 p 2 * z 2 1 ,
and
( r + λ 1 + λ 2 μ 1 ) p 2 * ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + λ 1 1 w 1 ( z 1 ) B 1 p 2 * z 1 + λ 1 1 w 1 ( z 2 ) B 2 p 2 * z 2 = K r + λ 1 + λ 2 μ 1 ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 + λ 1 1 w 1 ( z 1 ) B 1 z 1 p 2 * z 1 1 + λ 1 1 w 1 ( z 2 ) B 2 z 2 p 2 * z 2 1 = 0 .
By solving A 1 and A 2 from (11) and solving A 1 and A 2 from (12) and (13), we obtain
p 1 * y 1 0 0 p 1 * y 2 a 11 p 1 * + b 11 a 21 p 1 * + b 21 = p 2 * y 1 0 0 p 2 * y 2 a 12 p 2 * + b 12 a 22 p 2 * + b 22 .
Case 2  p 1 * > p 2 * . This case is similar to Case 1.
Case 3  p 1 * = p 2 * = : p * . By Lemma 6, we have
J 1 ( p ) = K J 2 ( p ) = K
on ( 0 , p * ] , and
( r + λ 1 ) J 1 ( p ) μ 1 p J 1 ( p ) 1 2 σ 1 2 p 2 J 1 ( p ) λ 1 J 2 ( p ) p + C = 0 ( r + λ 2 ) J 2 ( p ) μ 2 p J 2 ( p ) 1 2 σ 2 2 p 2 J 2 ( p ) λ 2 J 1 ( p ) p + C = 0
on ( p * , + ) .
Since J 1 and J 2 are Lipschitz continuous, we have by (14)
J 1 ( p ) = ( r + λ 1 + λ 2 μ 2 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + B ˜ 1 p z 1 + B ˜ 2 p z 2 J 2 ( p ) = ( r + λ 1 + λ 2 μ 1 ) p ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + λ 1 1 w 1 ( z 1 ) B ˜ 1 p z 1 + λ 1 1 w 1 ( z 2 ) B ˜ 2 p z 2
on ( p * , + ) , where B ˜ 1 and B ˜ 2 are some constants, and z 1 and z 2 are the solutions introduced in Lemma 4.
Therefore, by C 1 continuity of J 1 and J 2 , we have
( r + λ 1 + λ 2 μ 2 ) p * ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + B ˜ 1 p * z 1 + B ˜ 2 p * z 2 = K r + λ 1 + λ 2 μ 2 ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 + B ˜ 1 z 1 p * z 1 1 + B ˜ 2 z 2 p * z 2 1 = 0 ,
and
( r + λ 1 + λ 2 μ 1 ) p * ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 C r + λ 1 1 w 1 ( z 1 ) B ˜ 1 p * z 1 + λ 1 1 w 1 ( z 2 ) B ˜ 2 p * z 2 = K r + λ 1 + λ 2 μ 1 ( r + λ 1 μ 1 ) ( r + λ 2 μ 2 ) λ 1 λ 2 + λ 1 1 w 1 ( z 1 ) B ˜ 1 z 1 p * z 1 1 + λ 1 1 w 1 ( z 2 ) B ˜ 2 z 2 p * z 2 1 = 0 .
By solving B ˜ 1 and B ˜ 2 from (15) and solving B ˜ 1 and B ˜ 2 from (16), we obtain
a ˜ 11 p * + b ˜ 11 a ˜ 21 p * + b ˜ 21 = a ˜ 12 p * + b ˜ 12 a ˜ 22 p * + b ˜ 22 .
The proof is complete. □
Corollary 3.
If r > μ 2 and C > r K , then the conclusions in Theorem 8 hold.
Proof. 
The proof can be completed by the fact that r > μ 2 implies r > x 2 . □
Example 2.
Take μ 1 = 0.01 , μ 2 = 0.10 , σ 1 = 0.5 , σ 2 = 1 , r = 0.08 , λ 1 = 0.2 , λ 2 = 1 , C = 20 , K = 5 . Then we have r = 0.08 > 0.0260 = x 2 and C = 20 > 0.40 = r K . Thus, we apply Theorem 8, and find that (a) of Theorem 8 gives us ( p 1 * , p 2 * ) = ( 10.97 , 245.19 ) and the optimal stopping time τ * = inf { t : t > 0 , ( X ( t ) , P ( t ) ) { 1 } × ( 0 , 10.97 ] { 2 } × ( 0 , 245.19 ] } .
It is interesting to compare regime-switching cases with no-regime-switching cases. If there is no regime switching and the price P satisfies d P ( t ) = 0.01 P ( t ) d t + 0.5 P ( t ) d B ( t ) , the optimal stopping time is inf { t : t > 0 , P ( t ) ( 0 , 10.35 ] } [27] (Theorem 4.5). However, if the price P satisfies d P ( t ) = 0.10 P ( t ) d t + P ( t ) d B ( t ) , the firm should never stop the extraction since r = 0.08 < 0.10 = μ 2 [28] (Theorem 5.1).
In summary, the firm may stop the extraction even though it should never stop the extraction in one of the regimes.
Figure 2 shows a realization with initial data X ( 0 ) = 1 and P ( 0 ) = 200 . In the first interval where X ( t ) = 1 , there are several times at which P ( t ) p 2 * ; however, the firm still should not stop the extraction, because it is now regime 1, and in this regime, the firm stops only when P ( t ) p 1 * .

4. Conclusions

Regime-switching processes refer to the prices of financial assets and commodities [17,29,30]. In the present paper, we introduce a regime-switching process to describe the price of some natural resource. We provide a model concerning the extraction of natural resources, and determine the optimal decision on ending the extraction.
We employ the viscosity solution technique to solve the model. To this end, based on [26] (Theorems 1 and 2), we first develop a complete theory consisting of the regularity of the value function, optimal stopping strategies, and forms of optimal stopping intervals, and then use it to determine the optimal decision on ending the extraction.
At the end of the paper, a numerical example is demonstrated. From the example, we come to a conclusion that a firm may stop a project even though it should never stop the project in one of the regimes.
When using our model to solve an actual problem, we should first estimate the parameters involved in the model. We may consult [31,32] about how to estimate the parameters. To obtain closed-form solutions, we assume that there are just two regimes. If abandoning closed-form solutions, we may allow many regimes and obtain numerical solutions by computer. In the present paper, we only consider the optimal exit time; however, this is the first step to solving the so called entry–exit problem. The general theory obtained in our paper can be applied to not only this problem, but also other optimal stopping problems with regime switching.

Author Contributions

Methodology, Y.-C.Z., N.Z. and Q.Z.; Software, Y.-C.Z. and Q.Z.; Writing—original draft preparation, Y.-C.Z. and N.Z.; Writing—review and editing, Y.-C.Z., N.Z. and Q.Z.; Funding acquisition, Y.-C.Z. and Q.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Fundamental Research Funds for the Central Universities (Nos. N2023034 and 2021FZZX001-01) and National Natural Science Foundation of China (No. 12171426).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ma, Q.; Liu, X.; Wang, W.-G.; Xue, J. Natural resources extraction and COP26 target: Evaluating the role of green finance. Resour. Policy 2023, 82, 103432. [Google Scholar] [CrossRef]
  2. Liu, L. Natural resources extraction and global COP26 target: An overview of USA economy. Resour. Policy 2023, 82, 103560. [Google Scholar] [CrossRef]
  3. Alhassan, H.; Kwakwa, P.A. The effect of natural resources extraction and public debt on environmental sustainability. Manag. Environ. Qual. Int. J. 2023, 34, 605–623. [Google Scholar] [CrossRef]
  4. Teng, Y.P. Natural resources extraction and sustainable development: Linear and non-linear resources curse hypothesis perspective for high income countries. Resour. Policy 2023, 83, 103685. [Google Scholar] [CrossRef]
  5. Dadasov, R.; Hefeker, C.; Lorz, O. Natural resource extraction, corruption, and expropriation. Rev. World Econ. 2017, 153, 809–832. [Google Scholar] [CrossRef]
  6. Janus, T. Natural resource extraction and civil conflict. J. Dev. Econ. 2012, 97, 24–31. [Google Scholar] [CrossRef]
  7. Bella, G. Periodic solutions in the dynamics of an optimal resource extraction model. Environ. Econ. 2010, 1, 49–58. [Google Scholar]
  8. Engel, E.; Fischer, R. Optimal Resource Extraction Contracts under Threat of Expropriation. NBER Working Paper No. 13742. Available online: http://www.nber.org/papers/w13742 (accessed on 11 September 2023).
  9. Dixit, A. Entry and Exit Decisions under Uncertainty. J. Political Econ. 1989, 97, 620–638. [Google Scholar] [CrossRef]
  10. Duckworth, J.K.; Zervos, M. An Investment Model with Entry and Exit Decisions. J. Appl. Prob. 2000, 37, 547–559. [Google Scholar] [CrossRef]
  11. Tsekrekos, A.E. The effect of mean reversion on entry and exit decisions under uncertainty. J. Econom. Dynam. Control 2010, 34, 725–742. [Google Scholar] [CrossRef]
  12. Ferrari, G.; Yang, S. On an optimal extraction problem with regime switching. Adv. Appl. Prob. 2018, 50, 617–705. [Google Scholar] [CrossRef]
  13. Bachelier, L. Théorie de la spéculation. Ann. Sci. L’École Norm. Supérieure 1900, 17, 21–86. [Google Scholar] [CrossRef]
  14. Samuelson, P.A. Proof that properly anticipated prices fluctuate randomly. Ind. Manag. Rev. 1965, 6, 41–49. [Google Scholar]
  15. Karatzas, I.; Shreve, S.E. Brownian Motion and Stochastic Calculus, 2nd ed.; Springer: New York, NY, USA, 1991. [Google Scholar]
  16. Pham, H. Continuous-Time Stochastic Control and Optimization with Financial Applications; Springer: Berlin, Germany, 2009. [Google Scholar]
  17. Casassus, J.; Collin-Dufresne, P.; Routledge, B.R. Equilibrium Commodity Prices with Irreversible Investment and Non-Linear Technology. J. Bank Financ. 2018, 95, 128–147. [Google Scholar] [CrossRef]
  18. Castellano, R.; D’Ecclesia, R.L. Long swings in exchange rates: A stochastic control approach. Int. Trans. Oper. Res. 2007, 14, 475–489. [Google Scholar] [CrossRef]
  19. Bae, G.I.; Kim, W.C.; Mulvey, J.M. Dynamic asset allocation for varied financial markets under regime switching framework. Eur. J. Oper. Res. 2014, 234, 450–458. [Google Scholar] [CrossRef]
  20. Guo, X. An explicit solution to an optimal stopping problem with regime switching. J. Appl. Probab. 2001, 38, 464–481. [Google Scholar] [CrossRef]
  21. Guo, X.; Zhang, Q. Closed-form solutions for perpetual American put options with regime switching. SIAM J. Appl. Math. 2004, 64, 2034–2049. [Google Scholar]
  22. Guo, X.; Zhang, Q. Optimal selling rules in a regime switching model. IEEE Trans. Automat. Control 2005, 50, 1450–1455. [Google Scholar] [CrossRef]
  23. Bensoussan, A.; Yan, Z.; Yin, G. Threshold-type policies for real options using regime-switching Models. SIAM J. Financ. Math. 2012, 3, 667–689. [Google Scholar] [CrossRef]
  24. Pemy, M.N. Regime Switching Market Models and Applications. Ph.D. Thesis, The University of Georgia, Athens, GA, USA, 2005. [Google Scholar]
  25. Liu, R.H. Optimal stopping of switching diffusions with state dependent switching rates. Stochastics 2006, 88, 586–605. [Google Scholar] [CrossRef]
  26. Zhang, Y.C.; Zhang, N. A viscosity solution method for optimal stopping problems with regime switching. Acta Appl. Math. 2020, 170, 677–689. [Google Scholar] [CrossRef]
  27. Zhang, Y. Entry and exit decisions with linear costs under uncertainty. Stoch. Int. J. Probab. Stoch. Process 2015, 87, 209–234. [Google Scholar] [CrossRef]
  28. Zhang, Y.C. Entry-exit decisions with implementation delay under uncertainty. Appl. Math. 2018, 63, 399–422. [Google Scholar] [CrossRef]
  29. Chernova, M.; Gallantb, A.R.; Ghyselsb, E.; Tauchen, G. Alternative models for stock price dynamics. J. Econom. 2003, 116, 225–257. [Google Scholar] [CrossRef]
  30. Elliott, R.J.; Chan, L.; Siu, T.K. Pricing options in a Markov regime switching model with a random acceleration for the volatility. IMA J. Appl. Math. 2016, 81, 842–859. [Google Scholar] [CrossRef]
  31. Basawa, I.V.; Rao, B.P. Statistical Inference for Stochastic Processes; Academic Press: London, UK, 1980. [Google Scholar]
  32. Ross, S.M. An Elementary Introduction to Mathematical Finance: Options and Other Topics, 2nd ed.; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
Figure 1. Solutions to w 1 ( z ) w 2 ( z ) λ 1 λ 2 = 0 .
Figure 1. Solutions to w 1 ( z ) w 2 ( z ) λ 1 λ 2 = 0 .
Mathematics 11 04268 g001
Figure 2. A realization of Example 2.
Figure 2. A realization of Example 2.
Mathematics 11 04268 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, Y.-C.; Zhang, N.; Zhou, Q. The Closed-Form Solution of an Extraction Model and Optimal Stopping Problems with Regime Switching. Mathematics 2023, 11, 4268. https://doi.org/10.3390/math11204268

AMA Style

Zhang Y-C, Zhang N, Zhou Q. The Closed-Form Solution of an Extraction Model and Optimal Stopping Problems with Regime Switching. Mathematics. 2023; 11(20):4268. https://doi.org/10.3390/math11204268

Chicago/Turabian Style

Zhang, Yong-Chao, Na Zhang, and Qinglong Zhou. 2023. "The Closed-Form Solution of an Extraction Model and Optimal Stopping Problems with Regime Switching" Mathematics 11, no. 20: 4268. https://doi.org/10.3390/math11204268

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop