SearcharxivSearch

arXiv · 1702.05921

A Mean-field Stochastic Control Problem with Partial Observations

Abstract

In this paper we are interested in a new type of {\it mean-field}, non-Markovian stochastic control problems with partial observations. More precisely, we assume that the coefficients of the controlled dynamics depend not only on the paths of the state, but also on the conditional law of the state, given the observation to date. Our problem is strongly motivated by the recent study of the mean field games and the related McKean-Vlasov stochastic control problem, but with added aspects of path-dependence and partial observation. We shall first investigate the well-posedness of the state-observation dynamics, with combined reference probability measure arguments in nonlinear filtering theory and the Schauder fixed point theorem. We then study the stochastic control problem with a partially observable system in which the conditional law appears nonlinearly in both the coefficients of the system and cost function. As a consequence the control problem is intrinsically "time-inconsistent", and we prove that the Pontryagin Stochastic Maximum Principle holds in this case and characterize the adjoint equations, which turn out to be a new form of mean-field type BSDEs.

Explore related subjects

Keep this discovery

BibTeXRIS

Rainer Buckdahn, Juan Li, Jin Ma. 2017-02-20. A Mean-field Stochastic Control Problem with Partial Observations. https://arxiv.org/abs/1702.05921

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