摘要
本文利用不动点原理讨论了一类定量微分对策理论中最优策略的计算方法问题。首先构造出了一种迭代方法,然后利用不动点原理分析了该迭代法的收敛性。本文给出的方法还可用于一类Nash微分对策的Nash策略的分散计算方法。
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.
出处
《自动化学报》
EI
CSCD
北大核心
1992年第2期143-150,共8页
Acta Automatica Sinica
关键词
收敛性
微分对策
最优策略
Quantitative differential games
optimal strategies
fixed point theorein
convergence.
