This discussion paper resulted in a publication in the 'International Journal of Game Theory', 40, 87-110.<P> A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for...</p>

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>

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

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

The Myerson's models on partial cooperation in cooperative games have been studied extensively by Borm, Owen, Tijs and Myerson. Hamiache proposes a new solution concept for the case in which the communication relations among players are modelled by means of an undirected graph. In this work, we...

We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value...