In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...

Simple games in partition function form are used to model voting situations where a coalition being winning or losing might depend on the way players outside that coalition organize themselves. Such a game is called a plurality voting game if in every partition there is at least one winning...