SearcharxivSearch

arXiv · 1409.6233

Robust feedback switching control: dynamic programming and viscosity solutions

Abstract

We consider a robust switching control problem. The controller only observes the evolution of the state process, and thus uses feedback (closed-loop) switching strategies, a non standard class of switching controls introduced in this paper. The adverse player (nature) chooses open-loop controls that represent the so-called Knightian uncertainty, i.e., misspecifications of the model. The (half) game switcher versus nature is then formulated as a two-step (robust) optimization problem. We develop the stochastic Perron method in this framework, and prove that it produces a viscosity sub and supersolution to a system of Hamilton-Jacobi-Bellman (HJB) variational inequalities, which envelope the value function. Together with a comparison principle, this characterizes the value function of the game as the unique viscosity solution to the HJB equation, and shows as a byproduct the dynamic programming principle for robust feedback switching control problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Erhan Bayraktar, Andrea Cosso, Huyen Pham. 2014-09-22. Robust feedback switching control: dynamic programming and viscosity solutions. https://arxiv.org/abs/1409.6233

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