An important open problem in the theory of TU-games is to determine whether a game has a stable core (Von Neumann-Morgenstern solution (1944)). This seems to be a rather difficult combinatorial problem. There are many sufficient conditions for core-stability. Convexity is probably the best known...

According to Maschler, Peleg and Shapley (1972) the bargaining set of a convex game coincides with its core and the kernel consists of the nucleolus only. In this paper we prove the same properties for [Gamma]-component additive games (= graph restricted games in the sense of Owen (1986)) if...

For a collection of subsets of a finite set N we define its core to be equal to the polyhedral cone {x∈IRN: ∑i∈N xi=0 and ∑i∈Sxi\geq0 for all S∈}. This note describes several applications of this concept in the field of cooperative game theory. Especially collections are considered...