, 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 …-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link-convexity … is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …

is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability …

An evolutionary style model of recontracting is given which guarantees convergence to core allocations of an underlying … cooperative game. Unlike its predecessors in the evolution/learning literature, this is achieved without assumptions of convexity …

guarantee that the Shapley value, being the average of all marginal vectors of the game, is an element of the core. Convexity of … nite set of players, for which it has to be determined how much payof each player must receive. The core of an NTU … coalition of players. For cooperative games with transferable utility (TU-games) the notion of convexity was introduced to …

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

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

of all players, equal gain splitting rules are defined.It is shown that these rules lead to core elements of the …

associated to proportionate flow shop problems.It is seen that PFS games have a nonempty core.Moreover, it is shown that PFS … Shapley value and a specific type of equal gain splitting rule which leads to core elements of the PFS game are proposed. …

special case of cycle-completeness, players join one by one, yielding the Shapley value. A weak form of convexity is … introduced, under which the value is guaranteed to be an element of the core. For games with complete graph communication the … condition coincides with convexity and in case the underlying graph is cycle-free it is weaker than super-additivity. …