We study cooperation structures with the following property: given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. TU-games restricted by union stable systems generalize graph-restricted games and games with permission structures. A study about...

In this paper, we study the position value for games in which partial cooperation exist, that is based on a union stable coalition system. The concept of basis is introduced for these systems, allowing for a definition of the position value. Moreover, an axiomatic characterization of the...

A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in...