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 …

the existence of a stable solution and the non-emptiness of the core, which holds in the other models with payments, is no … stable solutions of a multiple partners matching game in two different ways and perform a study on the core of the …

the average rankings of the other types of groups. We show that a core stable coalition structure always exists, provided …

requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no …

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 …