本文运用合作博弈的观点分析和解决在动态决策进程中出现的合作方式发生变化的问题。针对于在博弈树给定的有限个节点上随机改变联盟剖分的动态博弈,通过引入新的特征函数和最优准则,建立了动态最优解PGN向量,同时给出了求最优路径和最优解的算法。
This paper employs cooperative game theory to analyze and solve the problem of possible changes of coalition structure in dynamic decision process. For dynamic games that randomly change coalition partitions at limited fixed nodes of the game tree, the dynamic optimal solutions (PGN vector) and the algorithm for constructing the optimal sub-tree are given by introducing new defined character functions and optimal rules.