outside players play their best response noncooperatively, the core is always nonempty when the game has strategic …

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 …

core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same … core structure. We then associate a system of linear inequalities with each equivalence class, and we show that the system … of TU games on which the core correspondence is additive (even linear). For the case of convex games we prove that the …

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of … core of the combined game coincides with the sum of the cores of its components. On the other hand, for non-balanced games …, the binary relation associating two component games whose combination has an empty core is not transitive. However, we …

scale such games are quite tractable in analysis, computation, and realization. A core imputation comes in terms of …

sell-side). This simple and intuitive learning process implements core allocations even though agents have no knowledge of …