局部信息约束下网络演化博弈的动力学与优化(英文)
Dynamics and optimization of control networked evolutionary games with local information

网络演化博弈的优化问题是混合值逻辑网络的一个自然推广. 本文研究了一类网络演化博弈的优化控制问题, 其中每个控制个体在极大化自己的收益时只能获取到邻域信息. 首先, 利用矩阵的半张量积, 将局部信息约束下控制网 络演化博弈的动力学转化为相应的代数形式. 然后得到了局部信息约束下确定型网络演化博弈的最优控制序列. 最后, 基于动态规划的解, 研究了局部信息约束下概率型网络演化博弈的优化控制问题, 得到了最优控制序列的简单计算公 式. 两个数值例子验证了本文的理论结果.
The optimization of networked evolutionary games (NEGs) is a natural extension of optimization for mixvalued logical networks. This paper studies the optimization problem for a class of control NEGs, where each controller can only use the information of its neighbors so as to maximize its payoff over a finite or infinite number of time steps. First, the dynamics of control NEGs with local information is converted into an algebraic form by using the semi-tensor product of matrices. Then the optimal control sequences for deterministic NEGs with local information are obtained. Finally, based on the dynamic programming solutions, some easily computable formulas are provided for stochastic NEGs with local information. Two examples are presented to illustrate the theoretical results