Chain-component additive games are graph-restricted superadditive games, where an exogenously given line-graph determines the cooperative possibilities of the players. These games can model various multi-agent decision situations, such as strictly hierarchical organisations or...

In this paper, we characterize the class of games for which the core coincides with the core cover (compromise stable games). Moreover, we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems. Also, the class of convex...

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an order of the players and describes the efficient payoff vector giving the first players in the order their utopia demand as long as it is still possible...

The research that studies the interaction between sequencing situations and cooperative games, that started with the paper of Curiel et al. (1989), has become an established line of research. This paper introduces a new model in this field: partitioning sequencing situations and games. The...