SearcharxivSearch

arXiv · 2409.04207

Probabilistic Representation for Viscosity Solutions to Double-Obstacle Quasi-Variational Inequalities

Abstract

We prove the existence and uniqueness of viscosity solutions to quasi-variational inequalities (QVIs) with both upper and lower obstacles. In contrast to most previous works, we allow all involved coefficients to depend on the state variable and do not assume any type of monotonicity. It is well known that double obstacle QVIs are related to zero-sum games of impulse control, and our existence result is derived by considering a sequence of such games. Full generality is obtained by allowing one player in the game to randomize their control. A by-product of our result is that the corresponding zero-sum game has a value, which is a direct consequence of viscosity comparison. Utilizing recent results for backward stochastic differential equations (BSDEs), we find that the unique viscosity solution to our QVI is related to optimal stopping of BSDEs with constrained jumps and, in particular, to the corresponding non-linear Snell envelope. This gives a new probabilistic representation for double obstacle QVIs. It should be noted that we consider the min-max version (or equivalently the max-min version); however, the conditions under which solutions to the min-max and max-min versions coincide remain unknown and is a topic left for future work.

Explore related subjects

Keep this discovery

BibTeXRIS

Magnus Perninge. 2024-09-06. Probabilistic Representation for Viscosity Solutions to Double-Obstacle Quasi-Variational Inequalities. https://arxiv.org/abs/2409.04207

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