The top coalition property of Banerjee et al. (2001) and the common ranking property of Farrell and Scotchmer (1988) are sufficient conditions for core stability in hedonic games. We introduce the semistrict core as a stronger stability concept than the core, and show that the top coalition...

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 consider hedonic coalition formation games that are induced by a simple TU-game and a cooperative solution. For such models, Shenoy's (1979) absence of the paradox of smaller coalitions provides a sufficient condition for core existence. We present three different versions of his condition in...

We investigate a situation in which gains from cooperation are represented by a cooperative TU-game and a solution proposes a division of coalitional worths. In addition, asymmetries among players outside the game are captured by a vector of exogenous weights. If a solution measures players'...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...