Abstract

Methods of differential games are used to find the optimal solution in a multi-agent system with a network structure. A class of differential games on cycle-free graphs is described. A characteristic function of a special form is used, which takes into account the network structure of the game. The average tree solution is considered as a cooperative optimality principle. An illustrative example is given.

中文翻译：

---

网络结构多Agent系统中的平均树解

摘要

微分博弈方法用于在具有网络结构的多智能体系统中寻找最优解。描述了一类无环图上的微分博弈。使用特殊形式的特征函数，考虑到游戏的网络结构。平均树解被认为是合作最优原则。给出了一个说明性的例子。