Search arXivSearch

arXiv · 1707.04976

Stochastic Near-Optimal Controls for Path-Dependent Systems

Abstract

In this article, we present a general methodology for control problems driven by the Brownian motion filtration including non-Markovian and non-semimartingale state processes controlled by mutually singular measures. The main result of this paper is the development of a concrete pathwise method for characterizing and computing near-optimal controls for abstract controlled Wiener functionals. The theory does not require ad hoc functional differentiability assumptions on the value process and elipticity conditions on the diffusion components. The analysis is pathwise over suitable finite dimensional spaces and it is based on the weak differential structure introduced by Le\~ao, Ohashi and Simas jointly with measurable selection arguments. The theory is applied to stochastic control problems based on path-dependent SDEs where both drift and possibly degenerated diffusion components are controlled. Optimal control of drifts for path-dependent SDEs driven by fractional Brownian motion is also discussed. We finally provide an application in the context of financial mathematics. Namely, we construct near-optimal controls in a non-Markovian portfolio optimization problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Dorival Leão, Alberto Ohashi, Francys Souza. 2017-07-17. Stochastic Near-Optimal Controls for Path-Dependent Systems. https://arxiv.org/abs/1707.04976

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