Search arXivSearch

arXiv · 2501.14263

Anticipated backward stochastic Volterra integral equations and their applications to nonzero-sum stochastic differential games

Abstract

In [J. Wen, Y. Shi, Stat. Probab. Lett. 156 (2020) 108599] the authors first introduced a kind of anticipated backward stochastic Volterra integral equations (anticipated BSVIEs, for short). By virtue of the duality principle, it is found in this paper that the anticipated BSVIEs can be applied to the study of stochastic differential games. Naturally, in order to develop the related theories and applications of BSVIEs, in this paper we deeply investigate a more general class of anticipated BSVIEs whose generator includes both pointwise and average time-advanced functions. In theory, the well-posedness and the comparison theorem of anticipated BSVIEs are established, and some regularity results of adapted M-solutions are proved by applying Malliavin calculus, which cover the previous results for BSVIEs. Further, using linear anticipated BSVIEs as the adjoint equation, we present the maximum principle for the nonzero-sum differential game system of stochastic delay Volterra integral equations (SDVIEs, for short) for the first time. As one of the applications of the principle, a Nash equilibrium point of the linear-quadratic differential game problem of SDVIEs is obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

Bixuan Yang, Tiexin Guo. 2025-01-24. Anticipated backward stochastic Volterra integral equations and their applications to nonzero-sum stochastic differential games. https://arxiv.org/abs/2501.14263

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR