Cooperative Stochastic Games

A cooperative stochastic n-person game on a finite graph tree is considered. The subtree of cooperative trajectories maximizing the sum of expected players’ payoffs is defined, and the solution of the game along the paths of this tree is investigated. The new notion of cooperative payoff distribution procedure (CPDP) is defined, and the time-consistent Shapley value is constructed.

[1]  Leon A. Petrosjan,et al.  The Shapley Value for Differential Games , 1995 .

[2]  L. Shapley A Value for n-person Games , 1988 .

[3]  R. Bellman Dynamic programming. , 1957, Science.

[4]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.