We study a stability notion in coalition formation games, give an efficient algorithm, and show that it is surprisingly good for general clustering tasks too.