Simple games in partition function form are used to model voting situations where a coalition being winning or losing might depend on the way players outside that coalition organize themselves. Such a game is called a plurality voting game if in every partition there is at least one winning...

We consider plurality voting games being simple games in partition function form such that in every partition there is at least one winning coalition. Such a game is said to be weighted if it is possible to assign weights to the players in such a way that a winning coalition in a partition is...

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 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 model the process of coalition formation in the 16th German Bundestag as a hedonic coalition formation game. In order to induce players' preferences in the game we apply the Shapley value of the simple game describing all winning coalitions in the Bundestag. Using different stability notions...

We are concerned with the problem of core membership testing for hedonic coalition formation games, which is to decide whether a certain coalition structure belongs to the core of a given game. We show that this problem is co-NP complete when players' preferences are additive.

This paper is devoted to the study of opportunity sets comparisons when the sets may contain options whose characteristics are not completely known. We propose a suitable environment in which this problem can be approached, and provide axiomatic characterizations of several rules for ranking...