The Myerson value for union stable structures
- 164 Downloads
We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. These combinatorial structures have a direct relationship with graph communication situations and conference structures à la Myerson. Characterizations of the Myerson value in this context are provided using the concept of basis for union stable systems. Moreover, TU-games restricted by union stable systems generalizes graph-restricted games and games with permission structures.
Unable to display preview. Download preview PDF.