Next Article in Journal
Picture Fuzzy Geometric Aggregation Operators Based on a Trapezoidal Fuzzy Number and Its Application
Next Article in Special Issue
Integro-Differential Equation for the Non-Equilibrium Thermal Response of Glass-Forming Materials: Analytical Solutions
Previous Article in Journal
On the Arcsecant Hyperbolic Normal Distribution. Properties, Quantile Regression Modeling and Applications
Previous Article in Special Issue
Effects of Second-Order Velocity Slip and the Different Spherical Nanoparticles on Nanofluid Flow
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Type of Time-Symmetric Stochastic System and Related Games

1
School of Mathematics and Quantitative Economics, Shandong University of Finance and Economics, Jinan 250014, China
2
Shandong Key Laboratory of Blockchain Finance, Shandong University of Finance and Economics, Jinan 250014, China
3
Institute for Financial Studies and School of Mathematics, Shandong University, Jinan 250100, China
4
Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, China
*
Author to whom correspondence should be addressed.
Symmetry 2021, 13(1), 118; https://doi.org/10.3390/sym13010118
Submission received: 17 December 2020 / Revised: 5 January 2021 / Accepted: 6 January 2021 / Published: 12 January 2021
(This article belongs to the Special Issue Integral Equations: Theories, Approximations and Applications)

Abstract

:
This paper is concerned with a type of time-symmetric stochastic system, namely the so-called forward–backward doubly stochastic differential equations (FBDSDEs), in which the forward equations are delayed doubly stochastic differential equations (SDEs) and the backward equations are anticipated backward doubly SDEs. Under some monotonicity assumptions, the existence and uniqueness of measurable solutions to FBDSDEs are obtained. The future development of many processes depends on both their current state and historical state, and these processes can usually be represented by stochastic differential systems with time delay. Therefore, a class of nonzero sum differential game for doubly stochastic systems with time delay is studied in this paper. A necessary condition for the open-loop Nash equilibrium point of the Pontriagin-type maximum principle are established, and a sufficient condition for the Nash equilibrium point is obtained. Furthermore, the above results are applied to the study of nonzero sum differential games for linear quadratic backward doubly stochastic systems with delay. Based on the solution of FBDSDEs, an explicit expression of Nash equilibrium points for such game problems is established.

1. Introduction

In 1994, Pardoux and Peng [1] put forward the following backward doubly stochastic differential equations (BDSDEs):
p ( t ) = ξ + t T F ( s , p ( s ) , q ( s ) ) d s + t T G ( s , p ( s ) , q ( s ) ) d B ( s ) t T q ( s ) d W ( s ) , 0 t T ,
which can be applied to produce a probabilistic expression of certain quasilinear stochastic partial differential equations (SPDEs). Because of its importance to SPDEs, the interest in BDSDEs has increased considerably (see [2,3,4,5,6,7,8,9,10,11,12,13,14,15]). At the same time, the stochastic control problem of backward doubly stochastic systems has been studied extensively (see [16,17,18,19,20,21]).
In 2003, Peng and Shi [22] introduced the following time-symmetric fully coupled forward–backward stochastic systems:
y ( t ) = x + 0 t f s , p ( s ) , y ( s ) , q ( s ) , z ( s ) d s 0 t z ( s ) d B ( s ) + 0 t g s , p ( s ) , y ( s ) , q ( s ) , z ( s ) d W ( s ) , p ( t ) = Φ y ( T ) + t T F s , p ( s ) , y ( s ) , q ( s ) , z ( s ) d s t T q ( s ) d W ( s ) + t T G s , p ( s ) , y ( s ) , q ( s ) , z ( s ) d B ( s ) ,
which are the so-called forward–backward doubly stochastic differential equations (FBDSDEs). The forward and backward equations in Equation (2) are the BDSDE in Equation (1) with stochastic integrals in different directions. Therefore, the FBDSDE in Equation (2) is established to provide a more general framework of fully coupled forward–backward stochastic differential equations. Under some monotone assumptions, Peng and Shi [22] obtained the unique solvability of FBDSDEs (2). Zhu et al. [23,24] have extended the results in [22] to different dimensions and the weaker monotonic assumptions, and gave the probabilistic interpretation for the solutions to SPDEs combined with algebra equations. Zhang and Shi [25] and Shi and Zhu [26] studied the stochastic control problem of FBDSDEs.
Game theory has penetrated into economic theory and attracted more and more research. It was first proposed by Von Neumann and Morgenstern [27]. Nash [28] has done groundbreaking work on non-cooperative games and presents the concept of a classic Nash equilibrium. Zhao et al. [29] studied the optimal investment and reinsurance of insurers in default securities under a mean-variance criterion in the jump-diffusion risk model. Many papers on stochastic differential game problems driven by backward stochastic differential equations have been published (see [30,31,32]). The differential game problem for forward–backward doubly stochastic differential equations was addressed in [33]. However, the future evolution of a lot of processes depends not only on their current state, but also on their historical state, and these processes can usually be characterized by stochastic differential equations with time delay. The optimal control problem for stochastic differential equations with delay was discussed in [34,35,36,37,38,39]. The nonzero sum differential game of the stochastic differential delay equation was studied in [40,41]. Shen and Zeng [42] researched the optimal investment and reinsurance with time delay for insurers under a mean-variance criterion.
The extra noise { B ( t ) } in Equation (1) can be regarded as some additional financial information that is not disclosed to the public in practice, such as in the derivative securities market, but is available to some investors. Arriojas et al. [43] and Kazmerchuk et al. [44] obtained the option pricing formula with time delay based on the stock price process with time delay. As far as we know, there is little discussion about differential games of doubly stochastic systems with delay. In this article, we will discuss this direction, that is, the following nonzero sum differential game driven by doubly stochastic systems with time delay. The control system is
d y ( t ) = f t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d t z ( t ) d B ( t ) + g t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d W ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , z ( t ) = ψ ( t ) , t [ δ , 0 ] ,
where ( y ( · ) , z ( · ) ) R n × R n × d is the state process pair, 0 < δ < T is a constant time delay parameter, and y δ ( t ) = y ( t δ ) , z δ ( t ) = z ( t δ ) . We denote J 1 ( v ( · ) ) and J 2 ( v ( · ) ) , v ( · ) = ( v 1 ( · ) , v 2 ( · ) ) , which are the cost functionals corresponding to the players 1 and 2:
J i ( v 1 ( · ) , v 2 ( · ) ) = E 0 T l i t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d t + Φ i ( y ( T ) ) , i = 1 , 2 .
Our task is to find ( u 1 ( · ) , u 2 ( · ) ) U 1 × U 2 such that
J 1 ( u 1 ( · ) , u 2 ( · ) ) = min v 1 ( · ) U 1 J 1 ( v 1 ( · ) , u 2 ( · ) ) , J 2 ( u 1 ( · ) , u 2 ( · ) ) = min v 2 ( · ) U 2 J 2 ( u 1 ( · ) , v 2 ( · ) ) .
To figure out the above nonzero sum differential game problem, it is natural to involve the adjoint equation, which is a kind of anticipated BDSDE (see [45,46]). It is therefore necessary to explore the following general FBDSDE with the forward equation being a delayed doubly SDE and the backward equation being the anticipated BDSDE:
d y ( t ) = f t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , y δ ( t ) , z δ ( t ) d t z ( t ) d B ( t ) + g t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , y δ ( t ) , z δ ( t ) d W ( t ) , t [ 0 , T ] , d p ( t ) = F t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , p δ + ( t ) , q δ + ( t ) d t q ( t ) d W ( t ) + G t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , p δ + ( t ) , q δ + ( t ) d B ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , t [ δ , 0 ] , z ( t ) = ψ ( t ) , t [ δ , 0 ] , p ( T ) = Φ ( y ( T ) ) , p ( t ) = ξ ( t ) , t [ T , T + δ ] , q ( t ) = η ( t ) , t [ T , T + δ ] ,
where y δ ( t ) = y ( t δ ) , z δ = z ( t δ ) , p δ + ( t ) = p ( t + δ ) , q δ + = q ( t + δ ) .
Our work differs from the above in the following distinctions. First of all, we introduce a time-symmetric stochastic system, which generalizes the results in [22] to a more general case: forward doubly stochastic differential equations (SDEs) with delay as forward equations and anticipated backward doubly stochastic differential equations as backward equations. Secondly, we investigate the problem of a nonzero sum differential game driven by doubly stochastic systems with time delay, which enriches the types of stochastic delayed differential game problems. Finally, we explore the linear quadratic (LQ) games for a doubly stochastic system with time delay, and use the solution of the above general FBDSDE to give an explicit expression of the unique equilibrium point.
The structure of this paper is as follows. We give the framework of the doubly stochastic games with delay and a preliminary view on the general FBDSDE in Section 2. We set up a necessary condition for the open-loop Nash equilibrium of such games to form a Pontryagin maximum principle in Section 3. Section 4 is devoted to the verification theorem of a sufficient condition for Nash equilibrium. In order to visually demonstrate the above results, the nonzero sum differential game for LQ double stochastic delay systems is studied in Section 5. By using the results of our FBDSDE, the explicit representation of Nash equilibrium points for LQ game problems is obtained. For the convenience of the reader, we present the skeleton of the proof on uniqueness and existence for the general FBDSDE in Section 6. Finally, we conclude this article with a summary.

2. Formulation of Problems and Preliminaries

2.1. Notations and Formulation of Problems

Suppose Ω , F , P is a probability space, and [ 0 , T ] is a fixed arbitrarily large time duration throughout this paper. Let W ( t ) ; 0 t T and B ( t ) ; 0 t T be two mutually independent standard Brownian motions defined on Ω , F , P , with values in R d and R l , respectively. Let N denote the class of P-null elements of F . For each t 0 , T , we define F t F t W F t , T B , where F t W = N σ W ( r ) W ( 0 ) ; 0 r t , F t , T B = N σ B ( T ) B ( r ) ; t r T . Note that the collection F t , t 0 , T is neither increasing nor decreasing, and it does not produce a filtration. E denotes the expectation on Ω , F , P . E F t : = E [ · | F t ] denotes the conditional expectation under F t . We use the usual inner product · , · and Euclidean norm · in R n , R m , R m × l and R n × d . The symbol “” that appears on the superscript indicates the transpose of the matrix. All the equations and inequalities mentioned in this paper are in the sense of d t × d P almost surely on 0 , T × Ω . We introduce the following notations:
L 2 ( F T ; R n ) = { ξ : ξ is   an R n - valued , F T - measurable   random   variable   s . t . E | ξ | 2 < } , L F 2 ( 0 , T ; R n ) = { v ( t ) , 0 t T : v ( t ) is   an R n - valued   , F t - measurable   process s . t . E 0 T | v ( t ) | 2 d t < } .
We take into account the following controlled doubly stochastic differential systems with delay:
d y ( t ) = f t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d t z ( t ) d B ( t ) + g t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d W ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , z ( t ) = ψ ( t ) , t [ δ , 0 ] ,
where ( y ( · ) , z ( · ) ) R n × R n × d is the state process pair, 0 < δ < T is a constant time delay parameter, and y δ ( t ) = y ( t δ ) , z δ ( t ) = z ( t δ ) . Here, f : [ 0 , T ] × R n × R n × d × R n × R n × d × R k 1 × R k 2 R n , g : [ 0 , T ] × R n × R n × d × R n × R n × d × R k 1 × R k 2 R n × l are given functions, and ϕ ( · ) , ψ ( · ) L F 2 δ , 0 ; R n are the initial paths of y, z, respectively.
Let U i be a nonempty convex subset of R i and v i ( · ) be the control process of player i , i = 1 , 2 . We denote by U i the set of U i -valued control processes v i L F 2 ( 0 , T ; R k i ) and it is called the admissible control set for player i , i = 1 , 2 . Each element of U i is called an (open-loop) admissible control for player i , i = 1 , 2 . In addition, U = U 1 × U 2 is called the set of admissible controls for the two players.
We assume that
Hypothesis 1 (H1).
f and g are continuously differentiable with respect to ( y , y δ , z , z δ , v 1 , v 2 ) , and their partial derivatives are bounded.
Now, if both v 1 ( · ) and v 2 ( · ) are admissible controls, and assumption (H1) holds, then doubly stochastic differential equation with delay (3) admits a unique solution ( y ( · ) , z ( · ) ) L F 2 δ , T ; R n × L F 2 δ , T ; R n × l (see [20]). The two players have their own benefits, which are described by the cost functional
J i ( v 1 ( · ) , v 2 ( · ) ) = E 0 T l i t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , v 1 ( t ) , v 2 ( t ) d t + Φ i ( y ( T ) ) ,
where l i : [ 0 , T ] × R n × R n × d × R n × R n × d × R k 1 × R k 2 R and Φ i : R n R are given functions, i = 1 , 2 .
We also assume
Hypothesis 2 (H2).
l i is continuously differentiable in ( y , z , y δ , z δ , v 1 , v 2 ) , its partial derivatives are continuous in ( y , z , y δ , z δ , v 1 , v 2 ) and bounded by c ( 1 + | y | + | z | + | y δ | + | z δ | + | v 1 | + | v 2 | ) . Moreover, Φ i ( y ) is continuously differentiable in y and Φ i y ( y ) is bounded by c ( 1 + | y | ) .
Assume that each participant wants to minimize her/his cost functional J i ( v 1 ( · ) , v 2 ( · ) ) by selecting an appropriate admissible control v i ( · ) ( i = 1 , 2 ) . Then the problem is to find a pair of admissible controls ( u 1 ( · ) , u 2 ( · ) ) U 1 × U 2 such that
J 1 ( u 1 ( · ) , u 2 ( · ) ) = min v 1 ( · ) U 1 J 1 ( v 1 ( · ) , u 2 ( · ) ) , J 2 ( u 1 ( · ) , u 2 ( · ) ) = min v 2 ( · ) U 2 J 2 ( u 1 ( · ) , v 2 ( · ) ) .
We call the above problem a doubly stochastic differential game with time delay. For simplicity’s sake, let us write it as Problem (A). If we can find an admissible control u ( · ) = ( u 1 ( · ) , u 2 ( · ) ) satisfying Equation (4), then we call it an equilibrium point of Problem (A) and denote the corresponding state trajectory by ( y ( · ) , z ( · ) ) = ( y u ( · ) , z u ( · ) ) .

2.2. The General FBDSDE

We deal with the following general FBDSDE, in which the forward equation is a delayed doubly SDE, and the backward equation is the anticipated BDSDE:
d y ( t ) = f t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , y δ ( t ) , z δ ( t ) d t z ( t ) d B ( t ) + g t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , y δ ( t ) , z δ ( t ) d W ( t ) , t [ 0 , T ] , d p ( t ) = F t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , p δ + ( t ) , q δ + ( t ) d t q ( t ) d W ( t ) + G t , y ( t ) , p ( t ) , z ( t ) , q ( t ) , p δ + ( t ) , q δ + ( t ) d B ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , t [ δ , 0 ] , z ( t ) = ψ ( t ) , t [ δ , 0 ] , p ( T ) = Φ ( y ( T ) ) , p ( t ) = ξ ( t ) , t [ T , T + δ ] , q ( t ) = η ( t ) , t [ T , T + δ ] ,
where y δ ( t ) = y ( t δ ) , z δ = z ( t δ ) , p δ + ( t ) = p ( t + δ ) , q δ + = q ( t + δ ) , and
F : Ω × 0 , T × R n × R m × R n × l × R m × d × R m × R m × d R m , f : Ω × 0 , T × R n × R m × R n × l × R m × d × R n × R n × l R n , G : Ω × 0 , T × R n × R m × R n × l × R m × d × R m × R m × d R m × l , g : Ω × 0 , T × R n × R m × R n × l × R m × d × R n × R n × l R n × d , Φ : Ω × R n R m .
Given an m × n full-rank matrix H. Let us introduce some notation:
u = y p z q , y δ ( · ) p δ + ( · ) z δ ( · ) q δ + ( · ) = α μ β ν , A t , u , α , μ , β , ν = H F t , u , μ , ν H f t , u , α , β H G t , u , μ , ν H g t , u , , α , β .
where H G = H G 1 H G l and H g = H g 1 H g d .
Similar to [23,35,47], we present the definition of solution to FBDSDEs (5) as follows:
Definition 1.
A quadruple of F t -measurable stochastic processes y , p , z , q : Ω × [ δ , T ] × [ 0 , T + δ ] × [ δ , T ] × [ 0 , T + δ ] R n × R m × R n × l × R m × d is called a solution of FBDSDE (5), if y , p , z , q L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d and satisfies FBDSDE (5).
We suppose the following Assumption (H3) holds:
Hypothesis 3 (H3).
(i) 
0 T A t , u , α , μ , β , ν A t , u ¯ , α ¯ , μ ¯ , β ¯ , ν ¯ , u u ¯ d t 0 T [ μ 1 H y y ¯ 2 + H z z ¯ 2 μ 2 H p p ¯ 2 + H q q ¯ 2 ] d t , u = y , p , z , q , u ¯ = y ¯ , p ¯ , z ¯ , q ¯ R n × R m × R n × l × R m × d ;
(ii) 
Φ y Φ y ¯ , H y y ¯ β 1 H y y ¯ 2 , y , y ¯ R n ; where μ 1 , μ 2 and β 1 are given non-negative constants with μ 1 + μ 2 > 0 , and μ 2 + β 1 > 0 . Moreover we have μ 1 > 0 , β 1 > 0 ( resp . , μ 2 > 0 ) when m > n ( resp . , m < n ) ;
(iii) 
for each u , α , μ , β , ν , A · , u , α , μ , β , ν is an F t -measurable vector process defined on 0 , T with A · , 0 L F 2 0 , T , and for each y R n , Φ y is an F T -measurable random vector with Φ 0 L 2 F T ; R m ;
(iv) 
A t , u , α , μ , β , ν and Φ satisfy the Lipschitz conditions: there exist constants k > 0 and 0 < λ < 1 such that u , u ¯ , α , α ¯ , μ , μ ¯ , β , β ¯ , ν , ν ¯ , t 0 , T , f t , u , α , β f t , u ¯ , α ¯ , β ¯ k u u ¯ + α α ¯ + β β ¯ , F t , u , μ , ν F t , u ¯ , μ ¯ , ν ¯ k u u ¯ + E F t [ μ μ ¯ + ν ν ¯ ] , g t , u , α , β g t , u ¯ , α ¯ , β ¯ k y y ¯ + p p ¯ + q q ¯ + α α ¯ + λ ( z z ¯ + β β ¯ ) , G t , u , μ , ν G t , u ¯ , μ ¯ , ν ¯ k y y ¯ + p p ¯ + z z ¯ + E F t [ μ μ ¯ ] + λ ( q q ¯ + E F t [ ν ν ¯ ] ) , Φ y Φ y ¯ k y y ¯ .
By the similar method of [23,35,47], we can prove the following Theorem 1. For the convenience of the reader, we present the skeleton of the proof in Section 6.
Theorem 1.
Under assumption(H3), then FBDSDE (5) has a unique solution ( y , p , z , q ) L F 2 ( δ , T ; R n ) × L F 2 ( 0 , T + δ ; R m ) × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d .

3. Necessary Maximum Principle

For convex admissible control sets, the classical method to obtain the necessary optimality condition is the convex perturbation method. Let u ( · ) = ( u 1 ( · ) , u 2 ( · ) ) be an equilibrium point of Problem (A) and ( y ( · ) , z ( · ) ) be the corresponding optimal trajectory. Let ( v 1 ( · ) , v 2 ( · ) ) be such that ( u 1 ( · ) + v 1 ( · ) , u 2 ( · ) + v 2 ( · ) ) U 1 × U 2 . Since U 1 and U 2 are convex, for any 0 ρ 1 , ( u 1 ρ ( · ) , u 2 ρ ( · ) ) = ( u 1 ( · ) + ρ v 1 ( · ) , u 1 ( · ) + ρ v 1 ( · ) ) is also in U 1 × U 2 . As illustrated before, we denote by ( y u 1 ρ ( · ) , z u 1 ρ ( · ) ) and ( y u 2 ρ ( · ) , z u 2 ρ ( · ) ) the corresponding state trajectories of the game system in Equation (3) along with the controls ( u 1 ρ ( · ) , u 2 ( · ) ) and ( u 1 ( · ) , u 2 ρ ( · ) ) .
For convenience, we use the following notations throughout this paper:
φ ( t ) = φ ( t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , u 1 ( t ) , u 2 ( t ) ) , φ u 1 ρ ( t ) = φ ( t , y ρ ( t ) , z ρ ( t ) , y δ ρ ( t ) , z δ ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) , φ u 2 ρ ( t ) = φ ( t , y ρ ( t ) , z ρ ( t ) , y δ ρ ( t ) , z δ ρ ( t ) , u 1 ( t ) , u 2 ρ ( t ) ) ,
where φ means one of f , g , l i , i = 1 , 2 .
We bring in the following variational equation:
d y i 1 ( t ) = [ f y ( t ) y i 1 ( t ) + f z ( t ) z i 1 ( t ) + f y δ ( t ) y i δ 1 ( t ) + f z δ ( t ) z i δ 1 ( t ) + f v i ( t ) v i ( t ) ] d t + [ g y ( t ) y i 1 ( t ) + g z ( t ) z i 1 ( t ) + g y δ ( t ) y i δ 1 ( t ) + g z δ ( t ) z i δ 1 ( t ) + g v i ( t ) v i ( t ) ] d W ( t ) z i 1 ( t ) d B ( t ) , y i 1 ( t ) = 0 , z i 1 ( t ) = 0 , t [ δ , 0 ] , ( i = 1 , 2 ) .
By (H1) and Theorem 3.1.1 in [20], it is easy to see that there is a unique adapted solution to Equation (6).
For t [ 0 , T ] , ρ > 0 , we set
y ˜ i ρ ( t ) = y u i ρ ( t ) y ( t ) ρ y i 1 ( t ) , z ˜ i ρ ( t ) = z u i ρ ( t ) z ( t ) ρ z i 1 ( t ) , ( i = 1 , 2 ) .
We have the following:
Lemma 1.
Let the hypotheses (H1) and (H2) be true. Then, for i = 1 , 2 ,
lim ρ 0 sup 0 t T E | y ˜ i ρ ( t ) | 2 = 0 ,
lim ρ 0 E 0 T | z ˜ i ρ ( t ) | 2 d t = 0 .
Proof of Lemma 1
For i = 1 , we have
d y ˜ 1 ρ ( t ) = [ 1 ρ f u 1 ρ ( t ) f ( t ) f y ( t ) y 1 1 ( t ) f z ( t ) z 1 1 ( t ) f y δ ( t ) y 1 δ 1 ( t ) f z δ ( t ) z 1 δ 1 ( t ) f v 1 ( t ) v 1 ( t ) ] d t + [ 1 ρ g u 1 ρ ( t ) g ( t ) g y ( t ) y 1 1 ( t ) g z ( t ) z 1 1 ( t ) g y δ ( t ) y 1 δ 1 ( t ) g z δ ( t ) z 1 δ 1 ( t ) g v 1 ( t ) v 1 ( t ) ] d W ( t ) z ˜ 1 ρ ( t ) d B ( t ) , y ˜ 1 ρ ( t ) = 0 , z ˜ 1 ρ ( t ) = 0 , t [ δ , 0 ] ,
or
d y ˜ 1 ρ ( t ) = [ A 1 ρ ( t , · ) y ˜ 1 ρ ( t ) + A ¯ 1 ρ ( t , · ) y ˜ 1 δ ρ ( t ) + B 1 ρ ( t , · ) z ˜ 1 ρ ( t ) + B ¯ 1 ρ ( t , · ) z ˜ 1 δ ρ ( t ) + G 1 ρ ( t ) ] d t + [ C 1 ρ ( t , · ) y ˜ 1 ρ ( t ) + C ¯ 1 ρ ( t , · ) y ˜ 1 δ ρ ( t ) + D 1 ρ ( t , · ) z ˜ 1 ρ ( t ) + D ¯ 1 ρ ( t , · ) z ˜ 1 δ ρ ( t ) + G 2 ρ ( t ) ] d W ( t ) z ˜ 1 ρ ( t ) d B ( t ) , y ˜ 1 ρ ( t ) = 0 , z ˜ 1 ρ ( t ) = 0 , t [ δ , 0 ] ,
where we denote
A 1 ρ ( t ) = 0 1 f y ( t , y 1 ( t ) + λ ( y u 1 ρ ( t ) y ( t ) ) , z u 1 ρ ( t ) , y δ u 1 ρ ( t ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , B 1 ρ ( t ) = 0 1 f z ( t , y ( t ) , z 1 ( t ) + λ ( z u 1 ρ ( t ) z ( t ) ) , y δ u 1 ρ ( t ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , A ¯ 1 ρ ( t ) = 0 1 f y δ ( t , y ( t ) , z ( t ) , y 1 δ ( t ) + λ ρ ( y 1 δ 1 ( t ) + y ˜ 1 δ ρ ( t ) ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , B ¯ 1 ρ ( t ) = 0 1 f z δ ( t , y ( t ) , z ( t ) , y δ ( t ) , z 1 δ ( t ) + λ ρ ( z 1 δ 1 ( t ) + z ˜ 1 δ ρ ( t ) ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , C 1 ρ ( t ) = 0 1 g y ( t , y 1 ( t ) + λ ( y u 1 ρ ( t ) y ( t ) ) , z u 1 ρ ( t ) , y δ u 1 ρ ( t ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , D 1 ρ ( t ) = 0 1 g z ( t , y ( t ) , z 1 ( t ) + λ ( z u 1 ρ ( t ) z ( t ) ) , y δ u 1 ρ ( t ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , C ¯ 1 ρ ( t ) = 0 1 g y δ ( t , y ( t ) , z ( t ) , y 1 δ ( t ) + λ ρ ( y 1 δ 1 ( t ) + y ˜ 1 δ ρ ( t ) ) , z δ u 1 ρ ( t ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , D ¯ 1 ρ ( t ) = 0 1 g z δ ( t , y ( t ) , z ( t ) , y δ ( t ) , z 1 δ ( t ) + λ ρ ( z 1 δ 1 ( t ) + z ˜ 1 δ ρ ( t ) ) , u 1 ρ ( t ) , u 2 ( t ) ) d λ , G 1 ρ ( t ) = 0 1 ( f v 1 ( t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , u 1 ( t ) + ρ λ v 1 ( t ) , u 2 ( t ) ) f v 1 ( t ) ) v 1 ( t ) d λ + [ A 1 ρ ( t ) f y ( t ) ] y 1 1 ( t ) + [ B 1 ρ ( t ) f z ( t ) ] z 1 1 ( t ) + [ A ¯ 1 ρ ( t ) f y δ ( t ) ] y 1 δ 1 ( t ) + [ B ¯ 1 ρ ( t ) f z δ ( t ) ] z 1 δ 1 ( t ) , G 2 ρ ( t ) = 0 1 ( g v 1 ( t , y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) , u 1 ( t ) + ρ λ v 1 ( t ) , u 2 ( t ) ) g v 1 ( t ) ) v 1 ( t ) d λ + [ C 1 ρ ( t ) g y ( t ) ] y 1 1 ( t ) + [ D 1 ρ ( t ) g z ( t ) ] z 1 1 ( t ) + [ C ¯ 1 ρ ( t ) g y δ ( t ) ] y 1 δ 1 ( t ) + [ D ¯ 1 ρ ( t ) g z δ ( t ) ] z 1 δ 1 ( t ) .
Using Itô’s formula to y ˜ 1 ρ ( t ) 2 on 0 , t , through (H1), we get
E y ˜ 1 ρ ( t ) 2 + E 0 t | z ˜ 1 ρ ( s ) | 2 d s C 0 E 0 t y ˜ 1 ρ ( s ) 2 d s + 1 2 E 0 t z ˜ 1 ρ ( s ) 2 d s + C 1 ( E 0 t ( | G 1 ρ ( s ) | 2 + | G 2 ρ ( s ) | 2 ) d s .
Applying Grownwall’s inequalities, we can easily get the desired result. Again, we can prove that for i = 2 . The proof is complete. □
Based on ( u 1 ( · ) , u 2 ( · ) ) being an equilibrium point of Problem (A), then
ρ 1 [ J 1 ( u 1 ρ ( · ) , u 2 ( · ) ) J 1 ( u 1 ( · ) , u 2 ( · ) ) ] 0 ,
ρ 1 [ J 2 ( u 1 ( · ) , u 2 ρ ( · ) ) J 2 ( u 1 ( · ) , u 2 ( · ) ) ] 0 .
From Equations (9) and (10) and Lemma 1, we obtain the following variational inequality.
Lemma 2.
Let assumptions(H1) and (H2) hold. Then
E 0 T l i y ( t ) y i 1 ( t ) + l i z ( t ) z i 1 ( t ) + l i y δ ( t ) y i δ 1 ( t ) + l i z δ ( t ) z i δ 1 ( t ) + l i v i ( t ) v i ( t ) d t + E [ Φ i y ( y ( T ) ) y i 1 ( T ) ] 0 , ( i = 1 , 2 ) .
Proof of Lemma 2
For i = 1 , from Equation (7), we derive
ρ 1 E [ Φ 1 ( y u 1 ρ ( T ) ) Φ 1 ( y ( T ) ) ] = ρ 1 E 0 1 Φ 1 y ( y ( T ) + λ ( y u 1 ρ ( T ) y ( T ) ) ) ( y u 1 ρ ( T ) y ( T ) ) d λ E [ Φ 1 y ( y ( T ) ) y 1 1 ( T ) ] , ρ 0 .
Similarly, we have
ρ 1 E 0 T [ l 1 u 1 ρ ( t ) l 1 ( t ) ] d t E 0 T l 1 y ( t ) y 1 1 ( t ) + l 1 z ( t ) z 1 1 ( t ) + l 1 y δ ( t ) y 1 δ 1 ( t ) + l 1 z δ ( t ) z 1 δ 1 ( t ) + l 1 v 1 ( t ) v 1 ( t ) d t , ρ 0 .
Let ρ 0 in Equation (9), so, for i = 1 , Equation (11) is established. Similarly, we can prove that the conclusion holds for i = 2 . The proof is complete. □
Let us define the Hamiltonian function H i : [ 0 , T ] × R n × R n × d × R n × R n × d × R k 1 × R k 2 × R n × R n × l R , i = 1 , 2 as follows:
H i ( t , y , z , y δ , z δ , v 1 , v 2 , p i , q i ) = f ( t , y , z , y δ , z δ , v 1 , v 2 ) , p i + g ( t , y , z , y δ , z δ , v 1 , v 2 ) , q i + l i ( t , y , z , y δ , z δ , v 1 , v 2 ) , i = 1 , 2 .
We introduce the following adjoint equation
d p i ( t ) = { H i y ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p i ( t ) , q i ( t ) ) + E F t [ H i y δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p i ( t + δ ) , q i ( t + δ ) ) ] } d t + { H i z ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p i ( t ) , q i ( t ) ) + E F t [ H i z δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p i ( t + δ ) , q i ( t + δ ) ) ] } d B ( t ) q i ( t ) d W ( t ) , p i ( T ) = Φ i y ( y ( T ) ) , p i ( t ) = 0 , q i ( t ) = 0 , t [ T , T + δ ] , ( i = 1 , 2 ) .
where Θ ( t ) : = ( y ( t ) , z ( t ) , y δ ( t ) , z δ ( t ) ) .
Remark 1.
It is easy to see that the adjoint Equation (12) above is a linear anticipated BDSDE, then the unique solvability of Equation (12) can be guaranteed by theorem 3.2 in [45] and theorem 2.4 in [46].
Theorem 2
(Necessary maximum principle). Suppose (H1) and (H2) hold, and ( u 1 ( · ) , u 2 ( · ) ) is an equilibrium point of Problem (A) and ( y ( · ) , z ( · ) ) is the corresponding state trajectory. Then we have
H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 u 1 ( t ) 0 , H 2 v 2 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 2 ( t ) , q 2 ( t ) ) , v 2 u 2 ( t ) 0 ,
hold for any ( v 1 , v 2 ) U 1 × U 2 , a.e., a.s., where ( p i ( · ) , q i ( · ) ( i = 1 , 2 ) is the solution of the adjoint Equation (12).
Proof of Theorem 2
For i = 1 . Using Itô’s formula to p 1 ( t ) , y 1 1 ( t ) , we obtain
E Φ 1 y ( y ( T ) ) , y 1 1 ( T ) = E 0 T p 1 ( t ) , f y ( t ) y 1 1 ( t ) + f z ( t ) z 1 1 ( t ) + f y δ ( t ) y 1 δ 1 ( t ) + f z δ ( t ) z 1 δ 1 ( t ) + f v 1 ( t ) v 1 ( t ) d t + E 0 T f y ( t ) p 1 ( t ) g y ( t ) q 1 ( t ) l 1 y ( t ) + E F t [ f y δ ( t + δ ) p 1 ( t + δ ) g y δ ( t + δ ) q 1 ( t + δ ) l 1 y δ ( t + δ ) ] , y 1 1 ( t ) d t + E 0 T q 1 ( t ) , g y ( t ) y 1 1 ( t ) + g z ( t ) z 1 1 ( t ) + g y δ ( t ) y 1 δ 1 ( t ) + g z δ ( t ) z 1 δ 1 ( t ) + g v 1 ( t ) v 1 ( t ) d t + E 0 T f z ( t ) p 1 ( t ) g z ( t ) q 1 ( t ) l 1 z ( t ) + E F t [ f z δ T ( t + δ ) p 1 ( t + δ ) g z δ T ( t + δ ) q 1 ( t + δ ) l 1 z δ ( t + δ ) ] , z 1 1 ( t ) d t .
Combining the initial conditions and the termination conditions, we get
E 0 T [ p 1 ( t ) , f y δ ( t ) y 1 δ 1 ( t ) E F t [ f y δ ( t + δ ) p 1 ( t + δ ) ] , y 1 1 ( t ) ] d t = E 0 T p 1 ( t ) , f y δ ( t ) y 1 δ 1 ( t ) d t E δ T + δ f y δ ( t ) p 1 ( t ) , y 1 δ 1 ( t ) d t = E 0 δ p 1 ( t ) , f y δ ( t ) y 1 δ 1 ( t ) d t E T T + δ f y δ ( t ) p 1 ( t ) , y 1 δ 1 ( t ) d t = 0 .
Similarly, we have
E 0 T [ p 1 ( t ) , f z δ ( t ) z 1 δ 1 ( t ) E F t [ f z δ ( t + δ ) p 1 ( t + δ ) ] , z 1 1 ( t ) ] d t = 0 , E 0 T [ q 1 ( t ) , g y δ ( t ) y 1 δ 1 ( t ) E F t [ g y δ ( t + δ ) q 1 ( t + δ ) ] , y 1 1 ( t ) ] d t = 0 , E 0 T [ q 1 ( t ) , g z δ ( t ) z 1 δ 1 ( t ) E F t [ g z δ ( t + δ ) q 1 ( t + δ ) ] , z 1 1 ( t ) ] d t = 0 .
Then, we get
E 0 T l 1 y ( t ) y 1 1 ( t ) + l 1 z ( t ) z 1 1 ( t ) + l 1 y δ ( t ) y 1 δ 1 ( t ) + l 1 z δ ( t ) z 1 δ 1 ( t ) + l 1 v 1 ( t ) v 1 ( t ) d t + E Φ 1 y ( y ( T ) ) , y 1 1 ( T ) = E 0 T f v 1 ( t ) p 1 ( t ) + g v 1 ( t ) q 1 ( t ) + l 1 v 1 ( t ) , v 1 ( t ) d t .
According to Lemma 2, we have
E 0 T H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 ( t ) d t 0 .
Because v 1 ( t ) satisfies u 1 ( t ) + v 1 ( t ) U 1 , we have
E 0 T H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 u 1 ( t ) d t 0 , v 1 U 1 ,
which means that
E H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 u 1 t 0 , a . s .
At present, take an arbitrary element F of σ -algebra F t , and set
w ( t ) = v 1 F + u ( t ) 1 Ω F .
Obviously, w ( t ) is an admissible control.
We apply the inequality in Equation (13) to w ( t ) , and get
E [ 1 F H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 u 1 t ] 0 , F F t ,
which contains that
E [ H 1 v 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) , v 1 u 1 t | F t ] 0 .
The expression within the conditional expectation is F t -measurable, so the result follows. Following the above proof, we can prove that the other inequality is true for any v 2 U 2 . The proof is completed. □

4. Sufficient Maximum Principle

In this section, the sufficient maximum principle for Problem (A) is investigated. Let ( y ( t ) , z ( t ) , u 1 ( t ) , u 2 ( t ) ) be a quintuple satisfying Equation (3), and suppose there exists a solution ( p i ( t ) , q i ( t ) ) of the corresponding adjoint forward SDE (12). We assume that:
Hypothesis 4 (H4).
For i = 1 , 2 , for all t 0 , T , H i ( t , y , z , y δ , z δ , v 1 , v 2 , p i , q i ) is convex in ( y , z , y δ , z δ , v 1 , v 2 ) , and Φ i ( y ) is convex in y.
Theorem 3
(Sufficient maximum principle). Suppose (H1), (H2) and (H4) are true. In addition, the following conditions hold
H 1 t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) = min v 1 U 1 H 1 t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ,
H 2 t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 2 ( t ) , q 2 ( t ) = min v 2 U 2 H 2 t , Θ ( t ) , u 1 ( t ) , v 2 ( t ) , p 2 ( t ) , q 2 ( t ) .
Then ( u 1 ( · ) , u 2 ( · ) ) is an equilibrium point of Problem (A).
Proof of Theorem 3
For any v 1 ( · ) U 1 , we consider
J 1 v 1 · , u 2 · J 1 u 1 · , u 2 · = E 0 T [ l 1 ( t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) ) l 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) ) ] d t + E Φ 1 y v 1 ( T ) Φ 1 y ( T ) .
Now we put into use Itô’s formula to p 1 ( t ) , y v 1 ( t ) y ( t ) on [ 0 , T ] , and get
E Φ 1 y y ( T ) , y v 1 ( T ) y ( T ) = E 0 T y v 1 ( t ) y ( t ) , H 1 y ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + E F t [ H 1 y δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t + E 0 T p 1 ( t ) , f ( t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) ) f ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) ) d t E 0 T z v 1 ( t ) z ( t ) , H 1 z ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + E F t [ H 1 z δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t + E 0 T q 1 ( t ) , g ( t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) ) g ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) ) d t .
Since Φ 1 is convex, we have
Φ 1 y v 1 ( T ) Φ 1 y ( T ) Φ 1 y y ( T ) , y v 1 ( T ) y ( T ) .
Then, we have
J 1 v 1 · , u 2 · J 1 u 1 · , u 2 · E 0 T [ H 1 ( t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) H 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) ] d t E 0 T y v 1 ( t ) y ( t ) , H 1 y ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + E F t [ H 1 y δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t E 0 T z v 1 ( t ) z ( t ) , H 1 z ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + E F t [ H 1 z δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t .
Based on the convexity of H 1 with respect to ( y , z , y δ , z δ , v 1 , v 2 ) , we achieve
H 1 ( t , Θ ( t ) , v 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) H 1 ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) y v 1 ( t ) y ( t ) , H 1 y ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + z v 1 ( t ) z ( t ) , H 1 z ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + z δ v 1 ( t ) z δ ( t ) , H 1 z δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) + v 1 ( t ) u 1 ( t ) , H 1 v 1 t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) .
Noticing the fact that
E 0 T y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t E 0 T y v 1 ( t ) y ( t ) , E F t [ H 1 y δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t = E 0 T y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t E δ T + δ y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t = E 0 δ y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t E T T + δ y δ v 1 ( t ) y δ ( t ) , H 1 y δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t = 0 .
Similarly, we have
E 0 T z δ v 1 ( t ) z δ ( t ) , H 1 z δ ( t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) ) d t E 0 T z v 1 ( t ) z ( t ) , E F t [ H 1 z δ ( t + δ , Θ ( t + δ ) , u 1 ( t + δ ) , u 2 ( t + δ ) , p 1 ( t + δ ) , q 1 ( t + δ ) ) ] d t = 0 .
Then, we get
J 1 v 1 · , u 2 · J 1 u 1 · , u 2 · E 0 T H 1 v 1 t , Θ ( t ) , u 1 ( t ) , u 2 ( t ) , p 1 ( t ) , q 1 ( t ) , v 1 ( t ) u 1 ( t ) d t .
Finally, by the necessary optimality conditions in Equation (14), we obtain
J 1 v 1 · , u 2 · J 1 u 1 · , u 2 · 0 .
This implies that
J 1 ( u 1 ( · ) , u 2 ( · ) ) = min v 1 ( · ) U 1 J 1 ( v 1 ( · ) , u 2 ( · ) ) .
In the same way
J 2 ( u 1 ( · ) , u 2 ( · ) ) = min v 2 ( · ) U 2 J 2 ( u 1 ( · ) , v 2 ( · ) ) .
Hence, the desired conclusion is drawn. The proof is completed. □

5. Applications in LQ Doubly Stochastic Games with Delay

In this section, our maximal principle is used for the nonzero sum differential game problem of LQ doubly stochastic systems with delay. To simplify the notation, let us assume that d = l = 1 . The control system is
d y ( t ) = [ A ( t ) y ( t ) + B ( t ) z ( t ) + A ¯ ( t ) y δ ( t ) + B ¯ ( t ) z δ ( t ) + E 1 ( t ) v 1 ( t ) + E 2 ( t ) v 2 ( t ) ] d t z ( t ) d B ( t ) + [ C ( t ) y ( t ) + D ( t ) z ( t ) + C ¯ ( t ) y δ ( t ) + D ¯ ( t ) z δ ( t ) ] d W ( t ) , t [ 0 , T ] , y ( t ) = ξ ( t ) , t [ δ , 0 ] , z ( t ) = η ( t ) , t [ δ , 0 ] ,
where ( ξ ( · ) , η ( · ) ) L F 2 δ , T ; R n is the initial path of ( y , z ) . A , A ¯ , B , B ¯ , C , C ¯ , D , D ¯ are n × n bounded matrices, v 1 ( t ) and v 2 ( t ) , t [ 0 , T ] are two admissible control processes, i.e., F t -measurable square-integrable processes taking values in R k . E 1 and E 2 are n × k bounded matrices. We denote J 1 ( v 1 ( · ) , v 2 ( · ) ) and J 2 ( v 1 ( · ) , v 2 ( · ) ) , which are the cost functionals corresponding to the players 1 and 2:
J i ( v 1 ( · ) , v 2 ( · ) ) = 1 2 E { 0 T [ M i ( t ) y ( t ) , y ( t ) + R i ( t ) z ( t ) , z ( t ) + N i ( t ) v i ( t ) , v i ( t ) ] d t + Q i y ( T ) , y ( T ) } , i = 1 , 2 ,
where M i ( t ) , R i ( t ) , Q i , i = 1 , 2 are n × n non-negative symmetric bounded matrices, and N i ( t ) , i = 1 , 2 are k × k positive symmetric bounded matrices and the inverse N i 1 ( t ) , i = 1 , 2 are also bounded. Our task is to find ( u 1 ( · ) , u 2 ( · ) ) R k × R k such that
J 1 ( u 1 ( · ) , u 2 ( · ) ) = min v 1 ( · ) U 1 J 1 ( v 1 ( · ) , u 2 ( · ) ) , J 2 ( u 1 ( · ) , u 2 ( · ) ) = min v 2 ( · ) U 2 J 2 ( u 1 ( · ) , v 2 ( · ) ) .
We need the following assumption:
Hypothesis 5 (H5).
E i ( N i ) 1 E i S = S E i ( N i ) 1 E i
where S = A , A ¯ , B , B ¯ , C , C ¯ , D , D ¯ , and i = 1 , 2 . Now, with the help of the above general FBDSDE, the explicit expression for the Nash equilibrium point of the above game problem can be obtained.
Theorem 4.
The mapping
( u 1 ( t ) , u 2 ( t ) ) = ( N 1 1 ( t ) E 1 ( t ) p 1 ( t ) , N 2 1 ( t ) E 2 ( t ) p 2 ( t ) ) , t [ 0 , T ] ,
is one Nash equilibrium point for the above game problems in Equations (16)–(18), where ( y ( t ) , z ( t ) , p 1 ( t ) , p 2 ( t ) , q 1 ( t ) , q 2 ( t ) ) is the solution of the following general FBDSDE:
d y ( t ) = [ A ( t ) y ( t ) + B ( t ) z ( t ) + A ¯ ( t ) y δ ( t ) + B ¯ ( t ) z δ ( t ) E 1 ( t ) N 1 1 ( t ) E 1 ( t ) p 1 ( t ) E 2 ( t ) N 2 1 ( t ) E 2 ( t ) p 2 ( t ) ] d t z ( t ) d B ( t ) + [ C ( t ) y ( t ) + D ( t ) z ( t ) + C ¯ ( t ) y δ ( t ) + D ¯ ( t ) z δ ( t ) ] d W ( t ) , t [ 0 , T ] , d p i ( t ) = { A ( t ) p i ( t ) + C ( t ) q i ( t ) + E F t [ A ¯ δ + ( t ) p i δ + ( t ) ) ] + E F t [ C ¯ δ + ( t ) q i δ + ( t ) ] + M i ( t ) y ( t ) } d t q i ( t ) d W ( t ) + { B ( t ) p i ( t ) + D ( t ) q i ( t ) + E F t [ B ¯ δ + ( t ) p i δ + ( t ) ] + E F t [ D ¯ δ + ( t ) q i δ + ( t ) ] + R i ( t ) z ( t ) } d B ( t ) , t [ 0 , T ] , y ( t ) = ξ ( t ) , t [ δ , 0 ] , z ( t ) = η ( t ) , t [ δ , 0 ] , p i ( T ) = Q i y ( T ) , p i ( t ) = 0 , t [ T , T + δ ] , i = 1 , 2 , q i ( t ) = 0 , t [ T , T + δ ] , i = 1 , 2 .
Similar to [31,48], the proof of Theorem 4 is easy to give, and we have therefore excluded it.
For sake of clarity, we give the following Problem (S), which is a special case of Problem (A). To simplify the notation, let us assume that n = d = l = k = 1 . The control system is
d y ( t ) = [ y δ ( t ) + z δ ( t ) + v 1 ( t ) + v 2 ( t ) ] d t z ( t ) d B ( t ) + y δ ( t ) d W ( t ) , t [ 0 , T ] , y ( t ) = ξ ( t ) , t [ δ , 0 ] , z ( t ) = η ( t ) , t [ δ , 0 ] ,
where ( ξ ( · ) , η ( · ) ) L F 2 δ , T ; R is the initial path of ( y , z ) . v 1 ( t ) and v 2 ( t ) , t [ 0 , T ] are two admissible control processes, i.e., F t -measurable square-integrable processes taking values in R . We denote J 1 ( v 1 ( · ) , v 2 ( · ) ) and J 2 ( v 1 ( · ) , v 2 ( · ) ) , which are the cost functionals corresponding to the players 1 and 2:
J i ( v 1 ( · ) , v 2 ( · ) ) = E 1 2 0 T v i 2 ( t ) d t + y ( T ) , i = 1 , 2 .
Our task is to find ( u 1 ( · ) , u 2 ( · ) ) R k × R k such that
J 1 ( u 1 ( · ) , u 2 ( · ) ) = min v 1 ( · ) U 1 J 1 ( v 1 ( · ) , u 2 ( · ) ) , J 2 ( u 1 ( · ) , u 2 ( · ) ) = min v 2 ( · ) U 2 J 2 ( u 1 ( · ) , v 2 ( · ) ) .
Then the Hamiltonian functions are
H i ( t , y δ , z δ , v 1 , v 2 , p i , q i ) = [ y δ + z δ + v 1 + v 2 ] p i + y δ q i + 1 2 , i = 1 , 2 ,
where ( p 1 ( t ) , p 2 ( t ) , q 1 ( t ) , q 2 ( t ) ) is the solution of the following adjoint equations:
d p i ( t ) = { E F t [ p i δ + ( t ) ) ] + E F t [ q i δ + ( t ) ] } d t q i ( t ) d W ( t ) + E F t [ p i δ + ( t ) ] d B ( t ) , t [ 0 , T ] , p i ( T ) = 1 , p i ( t ) = 0 , t [ T , T + δ ] , i = 1 , 2 , q i ( t ) = 0 , t [ T , T + δ ] , i = 1 , 2 .
It is easy to see that the above equation is the anticipated BDSDE, which is solvable theorem 3.2 in [45] and theorem 2.4 in [46]. From the maximum principle, we get that ( u 1 ( t ) , u 2 ( t ) ) = ( p 1 ( t ) , p 2 ( t ) ) , t [ 0 , T ] is one Nash equilibrium point for the above game in Equations (16)–(18).

6. The Proof of Theorem 1

Proof of Theorem 1
Since the initial path of ( y , z ) in [ δ , 0 ] and the terminal conditions and trajectories of ( p , q ) in [ T , T + δ ] are given in advance, we only need to consider ( y t , p t , z t , q t ) , 0 t T .
Uniqueness Let U = y , p , z , q and U ¯ = y ¯ , p ¯ , z ¯ , q ¯ be two solutions of Equation (3). We set U ^ = U U ¯ = y ^ , p ^ , z ^ , q ^ = y y ¯ , p p ¯ , z z ¯ , q q ¯ .
Applying Itô’s formula to H y ^ , p ^ on 0 , T , we have
E H y ^ ( T ) , Φ y ( T ) Φ y ¯ ( T ) = E 0 T A t , U ( t ) , α ( t ) , μ ( t ) , β ( t ) , ν ( t ) A t , U ¯ ( t ) , α ¯ ( t ) , μ ¯ ( t ) , β ¯ ( t ) , ν ¯ ( t ) , U ^ ( t ) d t μ 1 E 0 T H y ( t ) y ¯ ( t ) 2 + H z ( t ) z ¯ ( t ) 2 d t μ 2 E 0 T H p ( t ) p ¯ ( t ) 2 + H q ( t ) q ¯ ( t ) 2 d t .
By virtue of (H3), it follows that
μ 1 E 0 T H y ( t ) y ¯ ( t ) 2 + H z ( t ) z ¯ ( t ) 2 d t + μ 2 E 0 T H p ( t ) p ¯ ( t ) 2 + H q ( t ) q ¯ ( t ) 2 d t 0 .
If m > n , μ 1 > 0 , then we have H y ( t ) y ¯ ( t ) 2 0 and H z ( t ) z ¯ ( t ) 2 0 . Thus y ( t ) y ¯ ( t ) and z ( t ) z ¯ ( t ) . In particular, Φ y ( T ) = Φ y ¯ ( T ) . Consequently, from the uniqueness result of the anticipated BDSDE (see [45,46]), it follows that p ( t ) p ¯ ( t ) and q ( t ) q ¯ ( t ) .
If m < n , μ 2 > 0 , then we have H p ( t ) p ¯ ( t ) 2 0 and H q ( t ) q ¯ ( t ) 2 0 . Thus p ( t ) p ¯ ( t ) and q ( t ) q ¯ ( t ) . From the uniqueness result of the delayed doubly SDE (see [20]), it follows that y ( t ) y ¯ ( t ) and z ( t ) z ¯ ( t ) .
Similarly to the above arguments, the desired result can be obtained easily in the case n = m . The uniqueness is proved. □
The proof of the existence is a combination of the above technique and a priori estimate technique introduced by Peng [49]. We divide the proof of existence into three cases: m > n , m < n and m = n .
Case 1 If m > n , then μ 1 > 0 , β 1 > 0 . We consider the following family of FBDSDEs parametrized by α [ 0 , 1 ]
d y ( t ) = α f t , U ( t ) , y δ ( t ) , z δ ( t ) + f 0 t d t z ( t ) d B ( t ) + α g t , U ( t ) , y δ ( t ) , z δ ( t ) + g 0 t d W ( t ) , t [ 0 , T ] , d p ( t ) = α F t , U ( t ) , p δ + ( t ) , q δ + ( t ) + 1 α μ 1 H y ( t ) + F 0 t d t + α G t , U ( t ) , p δ + ( t ) , q δ + ( t ) + 1 α μ 1 H z ( t ) + G 0 t d B ( t ) q ( t ) d W ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , t [ δ , 0 ] , z ( t ) = ψ ( t ) , t [ δ , 0 ] , p ( T ) = α Φ y ( T ) + 1 α H y ( T ) + φ , p ( t ) = ξ ( t ) , t [ T , T + δ ] , q ( t ) = η ( t ) , t [ T , T + δ ] ,
where U = y , p , z , q and F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d and φ L 2 F T ; R m are arbitrarily given vector-valued random variables. When α = 1 the existence of the solution of Equation (21) implies clearly that of Equation (5). Due to the existence and uniqueness of the delayed doubly SDE (see [20]), when α = 0 , the Equation (21) is uniquely solvable. The following a priori lemma is a key step in the proof of the method of continuation. It shows that for a fixed α = α 0 [ 0 , 1 ) , if Equation (21) is uniquely solvable, then it is also uniquely solvable for any α [ α 0 , α 0 + γ 0 ] , for some positive constant γ 0 independent of α 0 .
Lemma 3.
We assume m > n . Under assumptions(H3), there exists a positive constant γ 0 such that if a priori, for each φ L 2 F T ; R m , F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (16) is uniquely solvable for some α 0 [ 0 , 1 ) , then for each α [ α 0 , α 0 + γ 0 ] , and φ L 2 F T ; R m , F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (16) is also uniquely solvable in L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 ( δ , T ; R n × l ) × L F 2 0 , T + δ ; R m × d .
Proof of Lemma 3
Since for φ L 2 F T ; R m , F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , there exists a unique solution to Equation (16) for α = α 0 . Thus for each U ¯ = y ¯ , p ¯ , z ¯ , q ¯ L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d , there exists a unique quadruple U = y , p , z , q L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d satisfying the following equations
d y ( t ) = α 0 f t , U ( t ) , y δ ( t ) , z δ ( t ) + γ f t , U ¯ ( t ) , y ¯ δ ( t ) , z ¯ δ ( t ) + f 0 t d t + [ α 0 g t , U ( t ) , y δ ( t ) , z δ ( t ) + γ g t , U ¯ ( t ) , y ¯ δ ( t ) , z ¯ δ ( t ) + g 0 t ] d W ( t ) z ( t ) d B ( t ) , t [ 0 , T ] , d p ( t ) = α 0 F t , U ( t ) , p δ + ( t ) , q δ + ( t ) + 1 α 0 μ 1 H y ( t ) + γ F t , U ¯ ( t ) , p ¯ δ + ( t ) , q ¯ δ + ( t ) μ 1 H y ¯ ( t ) + F 0 t d t + α 0 G t , U ( t ) , p δ + ( t ) , q δ + ( t ) + 1 α 0 μ 1 H z ( t ) + γ G t , U ¯ ( t ) , p ¯ δ + ( t ) , q ¯ δ + ( t ) μ 1 H y ¯ ( t ) + G 0 t d B ( t ) q ( t ) d W ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , t [ δ , 0 ] , z ( t ) = ψ ( t ) , t [ δ , 0 ] , p ( T ) = α 0 Φ y ( T ) + 1 α 0 H y ( T ) + γ Φ y ¯ ( T ) H y ¯ ( T ) + φ , p ( t ) = ξ ( t ) , t [ T , T + δ ] , q ( t ) = η ( t ) , t [ T , T + δ ] ,
where γ 0 , 1 is independent of α 0 . We will prove that the mapping defined by
U = I α 0 + γ ( U ¯ ) : L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d
is contractive for a small enough γ > 0 .
Let U ¯ = y ¯ , p ¯ , z ¯ , q ¯ L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d and y , p , z , q = U = I α 0 + δ U ¯ .
U ¯ ^ = U ¯ U ¯ = y ¯ ^ , p ¯ ^ , z ¯ ^ , q ¯ ^ = y ¯ y ¯ , p ¯ p ¯ , z ¯ z ¯ , q ¯ q ¯ , U ^ = U U = y ^ , p ^ , z ^ , q ^ = y y , p p , z z , q q .
Applying Itô’s formula to H y ^ , p ^ on 0 , T , it follows that
1 α 0 + α 0 β 1 E H y ^ ( T ) 2 + μ 1 E 0 T H y ^ ( t ) 2 + H z ^ ( t ) 2 d t γ C E 0 T U ¯ ^ ( t ) 2 + | y ¯ ^ δ ( t ) | 2 + | z ¯ ^ δ ( t ) | 2 + | p ¯ ^ δ + ( t ) | 2 + | q ¯ ^ δ + ( t ) | 2 d t + γ C E 0 T U ^ ( t ) 2 d t + γ C E y ^ ( T ) 2 + E y ¯ ^ ( T ) 2 γ C E 0 T | y ¯ ^ ( t ) | 2 + | z ¯ ^ ( t ) | 2 d t + E 0 T + δ | p ¯ ^ ( t ) | 2 + | q ¯ ^ ( t ) | 2 d t + γ C E 0 T U ^ ( t ) 2 d t + γ C E y ^ ( T ) 2 + E y ¯ ^ ( T ) 2 ,
with some constant C > 0 . Hereafter, C will be some generic constant, which can be different from line to line and depends only on the Lipschitz constants k, λ , μ 1 , β 1 , H and T. It is obvious that 1 α 0 + α 0 β 1 β , β = min ( 1 , β 1 ) > 0 .
On the other hand, for the difference of the solutions p ^ , q ^ = p p , q q , we apply a standard method of estimation. Applying Itô’s formula to p ^ ( t ) 2 on t , T , we have
E 0 T p ^ ( t ) 2 + q ^ ( t ) 2 d t γ C E 0 T | y ¯ ^ ( t ) | 2 + | z ¯ ^ ( t ) | 2 d t + E 0 T + δ | p ¯ ^ ( t ) | 2 + | q ¯ ^ ( t ) | 2 d t + C E y ^ ( T ) 2 + δ E y ¯ ^ ( T ) 2 + C E 0 T y ^ ( t ) 2 + z ^ ( t ) 2 d t .
Combining the estimates in Equations (22) and (23), for a sufficiently large constant C > 0 , we have
E δ T | y ^ ( t ) | 2 + | z ^ ( t ) | 2 d t + E 0 T + δ | p ^ ( t ) | 2 + | q ^ ( t ) | 2 d t + E y ^ ( T ) 2 γ C E δ T | y ¯ ^ ( t ) | 2 + | z ¯ ^ ( t ) | 2 d t + E 0 T + δ | p ¯ ^ ( t ) | 2 + | q ¯ ^ ( t ) | 2 d t + E y ¯ ^ ( T ) 2 .
We now choose γ 0 = 1 2 C . It is clear that, for each fixed γ 0 , γ 0 , the mapping I α 0 + γ is contractive in the sense that
E δ T | y ^ ( t ) | 2 + | z ^ ( t ) | 2 d t + E 0 T + δ | p ^ ( t ) | 2 + | q ^ ( t ) | 2 d t + E y ^ ( T ) 2 1 2 E δ T | y ¯ ^ ( t ) | 2 + | z ¯ ^ ( t ) | 2 d t + E 0 T + δ | p ¯ ^ ( t ) | 2 + | q ¯ ^ ( t ) | 2 d t + E y ¯ ^ ( T ) 2 .
Thus this mapping has a unique fixed point U = y , p , z , q L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d , which is the solution of Equation (16) for α = α 0 + γ , as γ [ 0 , γ 0 ] . The proof is complete. □
Case 2 If m < n , then μ 2 > 0 . We consider the following equations
d y ( t ) = α f t , U ( t ) , y δ ( t ) , z δ ( t ) + 1 α μ 1 H p ( t ) + f 0 t d t + α g t , U ( t ) , y δ ( t ) , z δ ( t ) + 1 α μ 1 H q ( t ) + g 0 t d W ( t ) z ( t ) d B ( t ) , t [ 0 , T ] , d p ( t ) = α F t , U ( t ) , p δ + ( t ) , q δ + ( t ) + F 0 t d t q ( t ) d W ( t ) + α G t , U ( t ) , p δ + ( t ) , q δ + ( t ) + G 0 t d B ( t ) , t [ 0 , T ] , y ( t ) = ϕ ( t ) , t [ δ , 0 ] , z ( t ) = ψ ( t ) , t [ δ , 0 ] , p ( T ) = α Φ y ( T ) + φ , p ( t ) = ξ ( t ) , t [ T , T + δ ] , q ( t ) = η ( t ) , t [ T , T + δ ] .
When α = 1 , the existence of the solution of Equation (24) implies clearly that of Equation (16). Due to the existence and uniqueness of the anticipated BDSDE (see [45,46]), when α = 0 , we know that Equation (24) is uniquely solvable. By the same techniques, we can also prove the following lemma similar to Lemma 3.
Lemma 4.
Assume m < n . Under assumption(H3), there exists a positive constant γ 0 such that if a priori, for each φ L 2 F T ; R m , and F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (24) is uniquely solvable for some α 0 [ 0 , 1 ) , then for each α [ α 0 , α 0 + γ 0 ] , and φ L 2 F T ; R m , F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (24) is also uniquely solvable in L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 ( δ , T ; R n × l ) × L F 2 0 , T + δ ; R m × d .
Case 3 m = n . From (H3), we only need to consider two cases as follows:
(1)
If μ 1 > 0 , μ 2 0 , β 1 > 0 , we can have the same result as Lemma 3.
(2)
If μ 1 0 , μ 2 > 0 , β 1 0 , the same result as Lemma 4 holds.
Now we give the proof of the existence of Theorem 1.
Proof of the Existence of Theorem 1.
For the first case where m > n , we know that for each φ L 2 F T ; R m , and F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (21) has a unique solution as α = 0 . It follows from Lemma 3 that there exists a positive constant γ 0 = γ 0 ( k , λ , β 1 , μ 1 , H , T ) such that for any γ [ 0 , γ 0 ] and φ L 2 F T ; R m , and F 0 , f 0 , G 0 , g 0 L F 2 0 , T ; R m + n + m × l + n × d , Equation (21) has a unique solution for α = γ . Since γ 0 depends only on k , λ , β 1 , μ 1 , H , T , we can repeat this process for N times with 1 N γ 0 < 1 + γ 0 . In particular, for α = 1 with F 0 , f 0 , G 0 , g 0 0 , and φ 0 , ψ 0 , Equation (21) has a unique solution in L F 2 δ , T ; R n × L F 2 0 , T + δ ; R m × L F 2 δ , T ; R n × l × L F 2 0 , T + δ ; R m × d .
In the case where m < n and m = n , our desired result can be obtained similarly. The proof of the existence of Theorem 1 is complete. □
Remark 2.
In the proof of the Existence of Theorem 1, (i) and (ii) in (H3) can be replaced by
(i)’
0 T A t , u , α , μ , β , ν A t , u ¯ , α ¯ , μ ¯ , β ¯ , ν ¯ , u u ¯ d t
0 T [ μ 1 H y y ¯ 2 + H z z ¯ 2 + μ 2 H p p ¯ 2 + H q q ¯ 2 ] d t ,
u = y , p , z , q , u ¯ = y ¯ , p ¯ , z ¯ , q ¯ R n × R m × R n × l × R m × d , t 0 , T .
(ii)’
Φ y Φ y ¯ , H y y ¯ β 1 H y y ¯ 2 , y , y ¯ R n .
where μ 1 , μ 2 and β 1 are given non-negative constants with μ 1 + μ 2 > 0 and μ 2 + β 1 > 0 . Moreover we have μ 1 > 0 , β 1 > 0 (resp., μ 2 > 0 ) when m > n (resp., m < n ).

7. Conclusions

The future evolution of a lot of processes depends not only on their current state, but also on their historical state, and these processes can usually be characterized by stochastic differential equations with time delay. In this article, we have discussed a class of differential games driven by doubly stochastic systems with time delay. To deal with the above nonzero sum differential game problem, it is natural to involve the adjoint equation, which is a kind of anticipated BDSDE. It is therefore necessary to explore a kind of general FBDSDE with the forward equation being a delayed doubly SDE and the backward equation being an anticipated BDSDE, which are so-called time-symmetry stochastic systems. This kind of FBDSDE covers a lot of the previous results, which promotes the results in [35] to doubly stochastic integrals, and extends the results in [23] to the case that involves the time delay and anticipation. We have adopted the convex variational method, and established a necessary condition and a sufficient condition for the equilibrium point of the game. In the LQ game problem, the state equation and the adjoint equation are completely coupled, then a class of linear FBDSDE is constructed, in which the forward equation is an anticipated forward doubly SDE and the backward equation is a delayed backward doubly SDE. By means of the unique solvability of the FBDSDE, the explicit expression for the Nash equilibrium point of the LQ game is obtained. Many financial and economic phenomena can be modeled by the LQ model, and we expect that the LQ game driven by doubly stochastic systems with time delay can be widely applied in these fields.
Notwithstanding that we are committed to the above game problem, we are also able to progress some consequences of optimal control for BDSDEs with time delay, for example Xu and Han [19,20].

Author Contributions

Writing—original draft preparation, writing—review and editing, Q.Z. and H.Z.; supervision, Y.S.; Conceptualization, J.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Key R&D Program of China (2018YFA0703900), National Natural Science Foundation of China (11871309, 11671229, 71871129, 11371226, 11301298), Southern University of Science and Technology Start up fund (Y01286233), Natural Science Foundation of Shandong Province of China (ZR2020MA032, ZR2019MA013), Special Funds of Taishan Scholar Project (tsqn20161041), and Fostering Project of Dominant Discipline and Talent Team of Shandong Province Higher Education Institutions.

Acknowledgments

The authors express their sincerest thanks to the reviewers for their valuable comments, which further improve the conclusion and proof process of the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pardoux, P.; Peng, S.G. Backward doubly stochastic differential equations and systems of quasilinear parabolic SPDEs. Probab. Theory Relat. Fields 1994, 98, 209–227. [Google Scholar] [CrossRef]
  2. Bahlali, K.; Gatt, R.; Mansouri, B.; Mtiraoui, A. Backward doubly SDEs and SPDEs with superlinear growth generators. Stoch. Dynam. 2017, 17, 1–31. [Google Scholar] [CrossRef]
  3. Bally, V.; Matoussi, A. Weak solutions for SPDEs and backward doubly stochastic differential equations. J. Theoret. Probab. 2001, 14, 125–164. [Google Scholar] [CrossRef]
  4. Hu, L.Y.; Ren, Y. Stochastic PDIEs with nonlinear Neumann boundary conditions and generalized backward doubly stochastic differential equations driven by Lévy processes. J. Comput. Appl. Math. 2009, 229, 230–239. [Google Scholar] [CrossRef]
  5. Ma, N.; Wu, Z. Backward doubly stochastic differential equations with Markov chains and a comparison theorem. Symmetry 2020, 12, 1953. [Google Scholar] [CrossRef]
  6. Matoussi, A.; Piozin, L.; Popier, A. Stochastic partial differential equations with singular terminal condition. Stoch. Proc. Appl. 2017, 127, 831–876. [Google Scholar] [CrossRef] [Green Version]
  7. Ren, Y.; Lin, A.H.; Hu, L.Y. Stochastic PDIEs and backward doubly stochastic differential equations driven by Lévy processes. J. Comput. Appl. Math. 2009, 223, 901–907. [Google Scholar] [CrossRef] [Green Version]
  8. Shi, Y.F.; Gu, Y.L.; Liu, K. Comparison theorems of backward doubly stochastic differential equations and applications. Stoch. Anal. Appl. 2005, 23, 97–110. [Google Scholar] [CrossRef]
  9. Shi, Y.F.; Wen, J.Q.; Xiong, J. Backward doubly stochastic Volterra integral equations and their applications. J. Differ. Equ. 2020, 269, 6492–6528. [Google Scholar] [CrossRef]
  10. Wen, J.Q.; Shi, Y.F. Backward doubly stochastic differential equations with random coefficients and quasilinear stochastic PDEs. J. Math. Anal. Appl. 2019, 476, 86–100. [Google Scholar] [CrossRef] [Green Version]
  11. Wu, Z.; Zhang, F. BDSDEs with locally monotone coefficients and Sobolev solutions for SPDEs. J. Differ. Equ. 2011, 251, 759–784. [Google Scholar] [CrossRef] [Green Version]
  12. Zhang, Q.; Zhao, H.Z. Stationary solutions of SPDEs and infinite horizon BDSDEs. J. Funct. Anal. 2007, 252, 171–219. [Google Scholar] [CrossRef] [Green Version]
  13. Zhang, Q.; Zhao, H.Z. Stationary solutions of SPDEs and infinite horizon BDSDEs under non-Lipschitz coefficients. J. Differ. Equ. 2010, 248, 953–991. [Google Scholar] [CrossRef] [Green Version]
  14. Zhang, Q.; Zhao, H.Z. SPDEs with polynomial growth coefficients and the Malliavin calculus method. Stoch. Proc. Appl. 2013, 123, 2228–2271. [Google Scholar] [CrossRef] [Green Version]
  15. Zhang, Q.; Zhao, H.Z. Backward doubly stochastic differential equations with polynomial growth coefficients. Discrete Con. Dyn. A 2015, 35, 5285–5315. [Google Scholar] [CrossRef] [Green Version]
  16. Bahlali, S.; Gherbal, B. Optimality conditions of controlled backward doubly stochastic differential equations. Random Oper. Stoch. Equ. 2010, 18, 247–265. [Google Scholar] [CrossRef]
  17. Han, Y.C.; Peng, S.G.; Wu, Z. Maximum principle for backward doubly stochastic control systems with applications. SIAM J. Control Optim. 2010, 48, 4224–4241. [Google Scholar] [CrossRef]
  18. Wu, J.B.; Liu, Z.M. Optimal control of mean-field backward doubly stochastic systems driven by Itô-Lévy processes. Int. J. Control 2020, 93, 953–970. [Google Scholar] [CrossRef]
  19. Xu, J.; Han, Y.C. Stochastic maximum principle for delayed backward doubly stochastic control systems. J. Nonlinear Sci. Appl. 2017, 10, 215–226. [Google Scholar] [CrossRef] [Green Version]
  20. Xu, J. Stochastic maximum principle for delayed doubly stochastic control systems and their applications. Int. J. Control 2020, 93, 1371–1380. [Google Scholar] [CrossRef]
  21. Zhu, Q.F.; Shi, Y.F. Optimal control of backward doubly stochastic systems with partial information. IEEE Trans. Autom. Control 2015, 60, 173–178. [Google Scholar] [CrossRef]
  22. Peng, S.G.; Shi, Y.F. A type of time-symmetric forward-backward stochastic differential equations. C. R. Acad. Sci. Paris Ser. I 2003, 336, 773–778. [Google Scholar] [CrossRef]
  23. Zhu, Q.F.; Shi, Y.F.; Gong, X.J. Solutions to general forward-backward doubly stochastic differential equations. Appl. Math. Mech. 2009, 30, 517–526. [Google Scholar] [CrossRef]
  24. Zhu, Q.F.; Shi, Y.F. Forward-backward doubly stochastic differential equations and related stochastic partial differential equations. Sci. China Math. 2012, 55, 2517–2534. [Google Scholar] [CrossRef]
  25. Zhang, L.Q.; Shi, Y.F. Maximum principle for forward-backward doubly stochastic control systems and applications. ESAIM Control Optim. Calc. Var. 2011, 17, 1174–1197. [Google Scholar] [CrossRef] [Green Version]
  26. Shi, Y.F.; Zhu, Q.F. Partially observed optimal control of forward-backward doubly stochastic systems. ESAIM Control Optim. Calc. Var. 2013, 19, 828–843. [Google Scholar] [CrossRef]
  27. Von Neumann, J.; Morgenstern, O. The Theory of Games and Economic Behavior; Princeton University Press: Princeton, NJ, USA, 1944. [Google Scholar]
  28. Nash, J. Non-cooperative games. Ann. Math. 1951, 54, 286–295. [Google Scholar] [CrossRef]
  29. Zhao, H.; Shen, Y.; Zeng, Y. Time-consistent investment-reinsurance strategy for mean-variance insurers with a defaultable security. J. Math. Anal. Appl. 2016, 437, 1036–1057. [Google Scholar] [CrossRef]
  30. Wang, G.C.; Yu, Z.Y. A Pontryagin’s maximum principle for nonzero sum differential games of BSDEs with applications. IEEE Trans. Autom. Control 2010, 55, 1742–1747. [Google Scholar] [CrossRef]
  31. Wang, G.C.; Yu, Z.Y. A partial information non-zero sum differential game of backward stochastic differential equations with applications. Automatica 2012, 48, 342–352. [Google Scholar] [CrossRef]
  32. Yu, Z.Y.; Ji, S.L. Linear-quadratic non-zero sum differential game of backward stochstic differential equations. In Proceedings of the 27th Chinese Control Conference, Kunming, China, 16–18 July 2008; pp. 562–566. [Google Scholar]
  33. Hui, E.; Xiao, H. Differential games of partial information forward-backward doubly SDE and applications. ESAIM Control Optim. Calc. Var. 2014, 20, 78–94. [Google Scholar] [CrossRef]
  34. Chen, L.; Wu, Z. Maximum principle for the stochastic optimal control problem with delay and application. Automatica 2010, 46, 1074–1080. [Google Scholar] [CrossRef]
  35. Chen, L.; Wu, Z. A type of generalized forward-backward stochastic differential equations and applications. Chin. Ann. Math. Ser. B 2011, 32, 279–292. [Google Scholar] [CrossRef]
  36. Chen, L.; Huang, J.H. Stochastic maximum principle for controlled backward delayed system via advanced stochastic differential equation. J. Optim. Theory Appl. 2015, 167, 1112–1135. [Google Scholar] [CrossRef]
  37. Meng, Q.X.; Shen, Y. Optimal control of mean-field jump-diffusion systems with delay: A stochastic maximum principle approach. J. Comput. Appl. Math. 2015, 279, 13–30. [Google Scholar] [CrossRef]
  38. Meng, Q.X.; Shen, Y. Optimal control for stochastic delay evolution equations. Appl. Math. Optim. 2016, 74, 53–89. [Google Scholar] [CrossRef]
  39. Shen, Y.; Meng, Q.X.; Shi, P. Maximum principle for jump-diffusion mean-field stochastic delay differential equations and its application to finance. Automatica 2014, 50, 1565–1579. [Google Scholar] [CrossRef] [Green Version]
  40. Chen, L.; Yu, Z.Y. Maximum principle for nonzero-sum stochastic differential game with delays. IEEE Trans. Autom. Control 2015, 60, 1422–1426. [Google Scholar] [CrossRef]
  41. Shi, J.T.; Wang, G.C. A nonzero sum differential game of BSDE with time-delayed generator and applications. IEEE Trans. Autom. Control 2016, 61, 1959–1964. [Google Scholar] [CrossRef]
  42. Shen, Y.; Zeng, Y. Optimal investment-reinsurance with delay for mean-variance insurers: A maximum principle approach. Insur. Math. Econ. 2014, 57, 1–12. [Google Scholar] [CrossRef]
  43. Arriojas, M.; Hu, Y.Z.; Mohammed, S.E.; Pap, G. A delayed black and scholes formula. Stoch. Anal. Appl. 2007, 25, 471–492. [Google Scholar] [CrossRef] [Green Version]
  44. Kazmerchuk, Y.; Swishchuk, A.; Wu, J.H. The pricing of option for securities markets with delayed response. Math. Comput. Simul. 2007, 75, 69–79. [Google Scholar] [CrossRef]
  45. Xu, X.M. Anticipated backward doubly stochastic differential equations. Appl. Math. Comput. 2013, 220, 53–62. [Google Scholar] [CrossRef] [Green Version]
  46. Zhang, F. Anticipated backward doubly stochastic differential equations. Sci. Sin. Math. 2013, 43, 1223–1236. (In Chinese) [Google Scholar] [CrossRef]
  47. Peng, S.G.; Wu, Z. Fully coupled forward-backward stochastic differential equations and applications to optimal control. SIAM J. Control Optim. 1999, 37, 825–843. [Google Scholar] [CrossRef]
  48. Zhu, Q.F.; Shi, Y.F. Nonzero-sum differential game of backward doubly stochastic systems with delay and applications. Math. Control Relat. F 2021, 11, 73–94. [Google Scholar] [CrossRef]
  49. Peng, S.G. Probabilistic interpretation for systems of quasilinear parabolic partial differential equations. Stochastics 1991, 37, 61–74. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhu, Q.; Shi, Y.; Wen, J.; Zhang, H. A Type of Time-Symmetric Stochastic System and Related Games. Symmetry 2021, 13, 118. https://doi.org/10.3390/sym13010118

AMA Style

Zhu Q, Shi Y, Wen J, Zhang H. A Type of Time-Symmetric Stochastic System and Related Games. Symmetry. 2021; 13(1):118. https://doi.org/10.3390/sym13010118

Chicago/Turabian Style

Zhu, Qingfeng, Yufeng Shi, Jiaqiang Wen, and Hui Zhang. 2021. "A Type of Time-Symmetric Stochastic System and Related Games" Symmetry 13, no. 1: 118. https://doi.org/10.3390/sym13010118

APA Style

Zhu, Q., Shi, Y., Wen, J., & Zhang, H. (2021). A Type of Time-Symmetric Stochastic System and Related Games. Symmetry, 13(1), 118. https://doi.org/10.3390/sym13010118

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