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 TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

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 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 compares for every component in the communication graph the total payoff to the players of...

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>

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>

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 TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...