We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the "name" but not the "type" of the other...

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

A coalitional matching is a two-sided matching problem in which agents on each side of the market may form coalitions such as student groups and research teams who - when matched - form universities. We assume that each researcher has preferences over the research teams he would like to work in...

We study dynamic multilateral markets, in which players' payoffs result from coalitional bargaining. In this setting, we establish payoff uniqueness of the stationary equilibria when players exhibit some degree of impatience. We focus on market games with different player types, and derive under...

We show that the core of each strongly size monotonic hedonic game is not empty and is externally stable. This is in sharp contrast to other sufficient conditions for core non-emptiness which do not even guarantee the existence of a stable set in such games. -- Core ; Hedonic Games ;...

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

In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are...

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