A Value for Digraph-restricted Games
Abstract
**Please note that the full text is embargoed** ABSTRACT: Digraph-restricted games model situations where some of the players, due to the lack of communication among them, are unable to cooperate. A digraph-restricted game v is defined as a function from the set of feasible coalitions to the reals. By strengthening the symmetry axiom we obtain an extension of the Shapley value for this class of games.
Key words. Shapley value, cooperative game, directed graph.