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

This paper is devoted to the study of how to extend a dichotomous partition of a universal set X into good and bad objects to an ordering on the power set of X. We introduce a family of rules that naturally take into account the number of good objects and the number of bad objects, and provide...

We study hedonic games with heterogeneous player types that reflect her nationality, ethnic background, or skill type. Agents' preferences are dictated by status-seeking where status can be either local or global. The two dimensions of status define the two components of a generalized constant...

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 the problem of how societies should be partitioned into classes if individuals express their views about who should be put with whom in the same class. A non-bossiness condition makes the social aggregator dependent only on those cells of the individual partitions the society members...