The Myerson Value and Superfluous Supports in Union Stable Systems

In this paper, the set of feasible coalitions in a cooperative game is given by a union stable system. Well‐known examples of such systems are communication situations and permission structures. Two games associated with a game on a union stable system are the restricted game (on the set of players in the game) and the conference game (on the set of supports of the system). We define two types of superfluous support property through these two games and provide new characterizations for the Myerson value. Finally, we analyze inheritance of properties between the restricted game and the conference game.