Coalition Formation in Structured Environments
Abstract
We study coalition formation games in which cooperation among the players is restricted by some combinatorial structures. We investigate the existence and computational issues related to stable outcomes in such games. In particular, we show that acyclicity is often sufficient for several notions of stability.