This discussion paper resulted in a publication in <I>Annals of Operations Research </I>, 2015, 225, 27-44.<P> This paper analyzes Harsanyi power solutions for cooperative games in which partial cooperation is based on union stable systems. These structures contain as particular cases the widely studied...</p></i>

This paper analyzes Harsanyi power solutions for cooperative games in which partial cooperation is based on union stable systems. These structures contain as particular cases the widely studied communication graph games and permission structures, among others. In this context, we provide...

In this survey, we present recent developments in the literature on Network games. We briefly cover the literature on Communication situations and the corresponding allocation rules. This is followed by a review on the existing player- and link-based fixed and flexible allocation rules for...

We reconsider the Myerson value and the position value for communication situations. In case the underlying game is a unanimity game, we show that each of these values can be computed using the inclusion--exclusion principle. Linearity of both values permits us to calculate them without needing...

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...