The Myerson value for union stable structures (Q1397017)

In this note the authors study cooperation structures with the following property: Given any two feasible coalitions with a non-empty intersection, its union is a feasible coalition again. The combinatorial structures have a direct relationship with graph communication situations and conference structures a la Myerson. The characterizations of the Myerson value in this context are provided using the concept of the basis for union stable systems. Moreover, \(TU\)-games restricted by union stable systems generalizes graph-restricted games and games with permission structures.