SearcharxivSearch

arXiv · 1308.5057

Nonlinear stochastic differential games involving a major player and a large number of collectively acting minor agents

Abstract

The purpose of this paper is to study 2-person zero-sum stochastic differential games, in which one player is a major one and the other player is a group of $N$ minor agents which are collectively playing, statistically identical and have the same cost-functional. The game is studied in a weak formulation; this means in particular, we can study it as a game of the type "feedback control against feedback control". The payoff/cost functional is defined through a controlled backward stochastic differential equation, for which driving coefficient is assumed to satisfy strict concavity-convexity with respect to the control parameters. This ensures the existence of saddle point feedback controls for the game with $N$ minor agents. We study the limit behavior of these saddle point controls and of the associated Hamiltonian, and we characterize the limit of the saddle point controls as the unique saddle point control of the limit mean-field stochastic differential game.

Explore related subjects

Keep this discovery

BibTeXRIS

Rainer Buckdahn, Juan Li, Shige Peng. 2013-08-23. Nonlinear stochastic differential games involving a major player and a large number of collectively acting minor agents. https://arxiv.org/abs/1308.5057

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