SOME ALGORITHMS FOR DIFFERENTIAL-GAMES WITH 2 PLAYERS AND ONE TARGET

We provide algorithms finding victory domains of a differential game with two players and one target. For doing this we do not need to compute trajectories of the game. We present two kinds of algorithms. The algorithms in continuous case give the victory set as a limit of an suitable decreasing sequence of closed sets. The algorithms in discrete cases give discrete sets approximating the victory domain. In the two cases, we prove convergence results.