ž)à-component additive games

According to Maschler, Peleg and Shapley the bargaining set of a convex game coincides with its core and the kernel consists of the nucleolus only. In this paper the authors prove the same properties for ¦)-component additive games (¸=graph restricted games in the sense of Owen) if ¦) is a tree. Furthermore, they give a description of the nucleolus of this type of games which makes it easier accessible for computation.