期刊:Annals of the International Society of Dynamic Games日期:2007-04-02卷期号:: 139-145被引量:15
标识
DOI:10.1007/0-8176-4501-2_7
摘要
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.