The numerical solution of three stochastic differential games (Q761360)

In this paper stochastic versions of three differential games, namely: the blocking game of \textit{R. Isaacs} [''Differential games'' (1965; Zbl 0125.380), Chap. 6], the game of patrolling a channel [ibid., Chap. 9] and the collision avoidance game of \textit{T. Basar} and \textit{G. J. Olsder} [''Noncooperative game theory'' (1982; Zbl 0479.90085), Chap. 8] are considered. The common factor of these differential games is that all three of them are modelled by the same set of stochastic differential equations. In each of the games sufficient conditions on optimal strategies in the case of complete observation and sufficient conditions on weak optimal strategies in the case of partial observations are derived. In the cases of complete observation, optimal strategies are computed for a variety of cases. In the cases of partial observation, procedures for computing weak suboptimal strategies are suggested, and these are computed for a variety of examples.