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

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 class of proper monotonic simple games and study coalition formation when an exogenous share vector and a solution concept are combined to guide the distribution of coalitional worth. Using a multiplicative composite solution, we induce players' preferences over coalitions in a...

We present a taxonomy of myopic stability concepts for hedonic games in terms of deviations, and discuss the status of the existence problems of stable coalition tructures. In particular, we show that contractual strictly core stable coalition tructures always exist, and provide su¢ cient...

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

In this paper we axiomatically characterize two recursive procedures for defining a social group. The first procedure starts with the set of all individuals who are defined by everyone in the society as group members, while the starting point of the second procedure is the set of all individuals...