Strong time-consistent solution for cooperative differential games with network structure

Abstract

One class of cooperative differential games on networks is considered. It is assumed that interaction on the network is possible not only between neighboring players, but also between players connected by paths. Various cooperative optimality principles and their properties for such games are investigated. The construction of the characteristic function is proposed, taking into account the network structure of the game and the ability of players to cut off connections. The conditions under which a strong time-consistent subcore is not empty are studied. The formula for explicit calculation of the Shapley value is derived. The results are illustrated by the example of one differential marketing game.