Two Person Zero-sum Game in Weak Formulation and Path Dependent Bellman-Isaacs Equation

Triet Pham; Jianfeng Zhang

Home/Archive/arXiv

arXiv · 1209.6605

Two Person Zero-sum Game in Weak Formulation and Path Dependent Bellman-Isaacs Equation

Triet Pham·Jianfeng Zhang

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we study a two person zero sum stochastic differential game in weak formulation. Unlike standard literature which uses strategy type of controls, the weak formulation allows us to consider the game with control against control. We shall prove the existence of game value under natural conditions. Another main feature of the paper is that we allow for non-Markovian structure, and thus the game value is a random process. We characterize the value process as the unique viscosity solution of the corresponding path dependent Bellman-Isaacs equation, a notion recently introduced by Ekren, Keller, Touzi and Zhang (arXiv:1109.5971) and Ekren, Touzi and Zhang.

Explore related subjects

math.PR math.OC

Keep this discovery

BibTeX RIS

Triet Pham, Jianfeng Zhang. 2012-09-28. Two Person Zero-sum Game in Weak Formulation and Path Dependent Bellman-Isaacs Equation. https://arxiv.org/abs/1209.6605

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗