Numerical Approximations for Non-Zero-Sum Stochastic Differential Games
BROWN UNIV PROVIDENCE RI DIV OF APPLIED MATHEMATICS
Pagination or Media Count:
The Markov chain approximation method is a widely used, and efficient family of methods for the numerical solution a large part of stochastic control problems in continuous time for reflected-jump-diffusion-type models. It converges under broad conditions, and there are good algorithms for solving the numerical approximations if the dimension is not too high. It has been extended to zero-sum stochastic differential games. We apply the method to consider a class of non-zero stochastic differential games with a diffusion system model where the controls for the two players are separated in the dynamics and cost function. There have been successful applications of the algorithms, but convergence proofs have been lacking. It is shown that equilibrium values for the approximating chain converge to equilibrium values for the original process and that any equilibrium value for the original process can be approximated by an epsilon-equilibrium for the chain for arbitrarily small epsilon 0. The numerical method solves a stochastic game for a finite-state Markov chain.
- Numerical Mathematics