-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity …, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

-building set. Properties of this solution are also studied. To establish core stability we introduce appropriate convexity …

coalition of players. For cooperative games with transferable utility (TU-games) the notion of convexity was introduced to … guarantee that the Shapley value, being the average of all marginal vectors of the game, is an element of the core. Convexity of … convexity. Under super-modularity of an NTU-game it is shown that all appropriately dened marginal vectors of the game are …

convexity type condition is provided that guarantees its stability with respect to an appropriately defined core concept. An …

-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity …, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity …, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …