Average Tree Solution in Multi-Agent Systems with Network Structure

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.