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

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

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 …

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

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

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 …

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 …