One of the most widely-studied model of games with restricted cooperation is the restricted communication model proposed by Myerson (1977). In Myerson’s approach, in addition to the game itself one considers an undirected graph that describes communication possibilities between the players. A modification of the Shapley value is then proposed under the assumption that coalitions that are not connected in this graph are split into connected components. In contrast, in our approach we focus on permutations, that is, on the way in which coalitions are formed, instead of imposing restrictions directly on possible coalitions.