来源：Mathematical Social Sciences, 2013, 65(2): 101-104.
DOI：10.1016/j.mathsocsci.2012.10.001
摘要
We investigate the computational complexity of a decision problem in hedonic coalition formation games. We prove that core stability in additive hedonic games is complete for the second level of the polynomial hierarchy.
科研之友
微信
新浪微博
Facebook
分享链接
