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...

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...

The MC-value is introduced as a new single-valued solution concept for monotonic NTU-games. The MC-value is based on marginal vectors, which are extensions of the well-known marginal vectors for TU-games and hyperplane games. As a result of the definition it follows that the MC-value coincides...

Three solution concepts for cooperative games with random payoffs are introduced. These are the marginal value, the dividend value and the selector value. Inspiration for their definitions comes from several equivalent formulations of the Shapley value for cooperative TU games. An example shows...