This paper investigates the suitability of apportionment methods based on the idea of preserving the coalition function of the simple game represented by the populations of the states. The results show that an apportionment method which satisfies desirable properties such as population...

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 consider the class of proper monotonic simple games and study coalition formation when an exogenous weight vector and a solution concept are combined to guide the distribution power within winning coalitions. These distributions induce players' preferences over coalitions in a hedonic game....

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 structures. In particular, we show that contractual strictly core stable coalition structures always exist, and provide sufficient...

This paper investigates conditions under which the core of a TU cooperative game is stable. In particular the author extends the idea of extendability to find new conditions under which the core is stable. It is also shown that these new conditions are not necessary for core stability. -- Core...

In this paper we are interested in efficient and individually rational exchange rules for markets with heterogeneous indivisible goods that exclude the possibility that an agent benefits by regrouping goods in her initial endowment. We present a suitable environment in which the existence of...

We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not. --...

The Shapley-Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear...