We analyze coalition formation problems in which a group of agents is partitioned into coalitions and agents' preferences only depend on the coalition they belong to. We study rules that associate to each profile of agents' preferences a partition of the society. We focus on strategy-proof rules on restricted domains of preferences, as the domains of additively representable or separable preferences. In such domains, the only strategy-proof and individually rational rules that satisfy either Pareto efficiency or non-bossiness and flexibility are single-lapping rules. Single-lapping rules are characterized by severe restrictions on the set of feasible coalitions that are consisitent with hierarchical organizations. These restrictions are necessary and sufficient for the existence of a unique core-stable partition. This fact implies that single-lapping rules always select the associated unique core-stable partition. Thus, our results highlight the relation between the non-cooperative concept of strategy-proofness and the cooperative concept of uniqueness of core-stable partitions.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.