The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced by an arbitrary digraph prescribing the dominance relation among the players, is introduced. It is deﬁned as the average of marginal contribution vectors corresponding to all permutations that do not violate the subordination of players. We assume that in order to cooperate players may join only coalitions containing no players dominating them. Properties of this solution are studied and a convexity type condition is provided that guarantees its stability with respect to an appropriately deﬁned core concept. An axiomatization for cycle digraph games for which the digraphs are directed cycles is obtained.