Algorithm and Convergence of Optimal Strategies in a Class of Quantitative Differential Games
一类定量微分对策理论中最优策略的算法及其收敛性

In this paper,the algorithm for finding the optimal strategies for a class of quantitative differential games is discussed, by making use of the fixed point theorem. First, we construct an iterative process by which the optimal strategies are found, then by making use of he fixed point theorem, we analyze the convergence of this iterative process. The method developed in this paper may find some applications in a class of Nash differential games where one seeks to develop some distributed algorithms for the computation of Nash equilibria.