Unique stability in simple coalition formation games

We investigate the uniqueness of stable coalition structures in a simple coalition formation model, for which specific coalition formation games, such as the marriage and roommate models, are special cases that are obtained by restricting the coalitions that may form. The main result is a characterization of collections of permissible coalitions which ensure that there is a unique stable coalition structure in the corresponding coalition formation model. In particular, we show that only single-lapping coalition formation models have a unique stable coalition structure for each preference profile, where single-lapping means that two coalitions cannot have more than one member in common, and coalitions do not form cycles. We also give another characterization using a graph representation, explore the implications of our results for matching models, and examine the existence of strategyproof coalition formation rules.