We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. The average tree solution...

To verify whether a transferable utility game is exact, one has to check a linear inequality for each exact balanced collection of coalitions. This paper studies the structure and properties of the class of exact balanced collections. Comparing the definition of exact balanced collections with...

In a standard TU-game it is assumed that every subset of the player set N can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure of Aumann and Drèze (1974). They assumed that the player set...