Stochastic games for distributed players on graphs. (Q703153)

The aim of the paper is to develop a general model for describing the interaction of players and coalitions which live on graph structured networks. They have to optimize their behaviour in sequential stochastic games. The existence of the game value and optimal strategies within the class of local strategies is shown. The transition mechanism of a system is homogeneous in time, locally determined and with general Markov properties in time and space. The set of the players is split into two disjoint coalitions and the rewards are paid between the coalitions by the players.