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

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>

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

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

This discussion paper resulted in a publication in 'Siberian Advances in Mathematics', 2002, 12, 97-125.<P> A cooperative game with transferable utilities, or simply aTU-game, describes a situation in which players can obtain certainpayoffs by cooperation. A solution mapping for these games is...</p>

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are nonnegative), and there is some hierarchical...

This discussion paper resulted in a publication in 'Economics Letters', 2012, 117, 786-789.<P> We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom...</p>

See also the publication in 'Journal of Mathematical Economics', 2008, 44, 1114-1125. <P> In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that...</p>

This discussion paper resulted in a publication in the 'European Journal of Operational Research', 2013, 224, 167-179.<P> In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are...</p>