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

distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …

ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove … that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the …

individual compensations, and one about case-system consistency. This unique compensation scheme is the nucleolus of an …

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

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 …

, these results state already that the set of Harsanyi payoff vectors is given by the core of an associated convex game, a …