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 …

We introduce a theory on marginal values and their core stability for cooperative games with arbitrary coalition … graph and the NT-solution coincides with the average tree solution. We also study core stability of the solutions and show … that both the HS-solution and NT-solution belong to the core under half-space supermodularity, which is a weaker condition …