Error estimates for stochastic differential games: the adverse stopping case
Résumé
We obtain error bounds for monotone approximation schemes of a particular Isaacs equation. This is an extension of the theory for estimating errors for the Hamilton-Jacobi-Bellman equation. For obtaining upper error bound, we consider the ``Krylov regularization'' of the Isaacs equation to build an approximate sub-solution of the scheme. To get lower error bound we extend the method of Barles and Jakobsen which consists in introducing a switching system whose solutions are local super-solutions of the Isaacs equation.
Loading...