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

the unique welfare distribution that is core-stable and satisfies the condition that no agent gets a utility payoff above … has an increasing benefit function (no externalities) then every weighted hierarchical solution is core-stable. In case of …

shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper … introduces the notion of the k-core cover as an extension of the core cover. The k-core cover of a TU-game consists of all … minimal rights game. It is shown that the core of a TU-game with player set N coincides with the L|N |/2-̦core cover …

coalitions also their union is feasible. Properties of solutions (the core, the nucleolus, the prekernel and the Shapley value …