We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

We consider three-sided coalition formation problems when each agent is concerned about his local status as measured by his relative rank position within the group of his own type and about his global status as measured by the weighted sum of the average rankings of the other types of groups. We...