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

We study the model of link formation that was introduced by Aumann and Myerson (1988) and focus on symmetric convex games with transferable utilities. We answer an open question in the literature by showing that in a specific symmetric convex game with six players a structure that results in the...

We study the relation between the fuzzy core and balancedness for fuzzy games. For regular games, this relation has been studied by Bondareva (1963) and Shapley (1967). First, we gain insight in this relation when we analyse situations where the fuzzy game is continuous. Our main result shows...

Different axiomatic systems for the Shapley value can be found in the literature. For games with a coalition structure, the Shapley value also has been axiomatized in several ways. In this paper, we discuss a generalization of the Shapley value to the class of partition function form games. The...