A value with incomplete communication

The aim of this article is to present a new value of a cooperative game for the case of limited communication between players. The communication syste m we consider may be represented by a simple graph, that is, only pairwise meetings can occur and some of them are not permitted. An associated game i s defined and the value has to verify a consistency axiom. The generalizati on proposed here is different from the Myerson value, and it coincides with the Shapley value in the case of full communication. Classification Number : C71. (C) 1999 Academic Press.