-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

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 …

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

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 …

nonnegative), and there is some hierarchical ordering of the players. In this paper we introduce the 'Restricted Core' for such … of the players. For totally positive games this solution is always contained in the 'Core', and contains the well … coalitions). For special orderings it equals the Core, respectively Shapley value. We provide an axiomatization and apply this …

Harsanyi set is related to the Core and Weberset. We also characterize the Harsanyi mapping as the unique mappingsatisfying a …