This discussion paper resulted in a publication in the 'Annals of Operations Research' (forthcoming).<P> We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted...</p>

This discussion paper resulted in a publication in 'Economics Letters', 2012, 117, 786-789.<P> We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom...</p>

This discussion paper resulted in a publication in the 'European Journal of Operational Research', 2013, 224, 167-179.<P> In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are...</p>

This discussion paper resulted in a publication in the 'Economic Theory', 2015, 58, 99-123.<P> In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of...</p>

This discussion paper resulted in a publication in the 'International Journal of Game Theory', 40, 87-110.<P> A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for...</p>

In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the players enter the coalition. Therefore, we model...

This discussion paper resulted in a publication in <I>Annals of Operations Research </I>, 2015, 225, 27-44.<P> This paper analyzes Harsanyi power solutions for cooperative games in which partial cooperation is based on union stable systems. These structures contain as particular cases the widely studied...</p></i>

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

We consider cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley...