SearcharxivSearch

arXiv · 2108.04583

Optimal control of martingales in a radially symmetric environment

Abstract

We study a stochastic control problem for continuous multidimensional martingales with fixed quadratic variation. In a radially symmetric environment, we are able to find an explicit solution to the control problem and find an optimal strategy. We show that it is optimal to switch between two strategies, depending only on the radius of the controlled process. The optimal strategies correspond to purely radial and purely tangential motion. It is notable that the value function exhibits smooth fit even when switching to tangential motion, where the radius of the optimal process is deterministic. Under sufficient regularity on the cost function, we prove optimality via viscosity solutions of a Hamilton-Jacobi-Bellman equation. We extend the results to cost functions that may become infinite at the origin. Extra care is required to solve the control problem in this case, since it is not clear how to define the optimal strategy with deterministic radius at the origin. Our results generalise some problems recently considered in Stochastic Portfolio Theory and Martingale Optimal Transport.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander M. G. Cox, Benjamin A. Robinson. 2021-08-10. Optimal control of martingales in a radially symmetric environment. https://doi.org/10.1016/j.spa.2023.01.016

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