The core in differential games on networks with communication restrictions

In this paper we consider a class of differential games on networks. It is assumed that the players are identified with the nodes of the network and their interaction takes place along the paths of this network. A characteristic function of a special kind is used, which takes into account the network structure of the game. The C-core is studied as a cooperative optimality principle. An illustrative example is considered.