一类定量微分对策理论中最优策略的算法及其收敛性
Algorithm and Convergence of Optimal Strategies in a Class of Quantitative Differential Games
-
摘要: 本文利用不动点原理讨论了一类定量微分对策理论中最优策略的计算方法问题.首先构 造出了一种迭代方法,然后利用不动点原理分析了该迭代法的收敛性.本文给出的方法还可 用于一类Nash微分对策的Nash策略的分散计算方法.Abstract: 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.
-
Key words:
- Quantitative differential games /
- optimal strategies /
- fixed point theorem /
- convergence
-
计量
- 文章访问数: 1899
- HTML全文浏览量: 46
- PDF下载量: 961
- 被引次数: 0
下载:
