Core stability and strategy-proofness in hedonic coalition formation problems with friend-oriented preferences
研究了朋友导向偏好下的享乐联盟形成问题，证明友谊图的强连通分量划分处于严格核心中，并发现SCC机制是唯一同时满足核心稳定性和策略防伪性的机制。
We study hedonic coalition formation problems with friend-oriented preferences; that is, each agent has preferences over his coalitions based on a partition of the set of agents, except himself, into “friends” and “enemies” such that (E) adding an enemy makes him strictly worse off and (F) adding a friend together with a set of enemies makes him strictly better off. Friend-oriented preferences induce a so-called friendship graph where vertices are agents and directed edges point to friends. We show that the partition associated with the strongly connected components (SCC) of the friendship graph is in the strict core. We then prove that the SCC mechanism, which assigns the SCC partition to each hedonic coalition formation problem with friend-oriented preferences, satisfies a strong group incentive compatibility property: group strategy-proofness . Our main result is that on any “rich” subdomain of friend-oriented preferences, the SCC mechanism is the only mechanism that satisfies core stability and strategy-proofness .