human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "stable partitions in additively separable hedonic games"
  Abstract: An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the computational complexity of stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractually individually stable partition. This contrasts with previous results such as the NP-hardness of computing individually stable or Nash stable partitions. Secondly, we prove that checking whether the core or the strict core exists is NP-hard in the strong sense even if the preferences of the players are symmetric. Finally, it is shown that verifying whether a partition consisting of the grand coalition is contractually strict core stable or Pareto optimal is coNP-complete.

Connected through hyperedge HE-1 (induced by source paper "on maximizing egalitarian value in k coalitional hedonic games"):
  with members:
    - "degree constrained 2 partitions of graphs"
    - "recent advances in graph partitioning"

Connected through hyperedge HE-2 (induced by source paper "coordination games on weighted directed graphs"):
  with members:
    - "self stabilization through the lens of game theory"
    - "efficient local search in coordination games on graphs"
    - "coordination games on directed graphs"
    - "efficient equilibria in polymatrix coordination games"
    - "existence of stability in hedonic coalition formation games"
    - "a classification of weakly acyclic games"
    - "on dynamics in selfish network creation"
    - "social network games"

Connected through hyperedge HE-3 (induced by source paper "computational complexity of hedonic games on sparse graphs"):
  with members:
    - "hedonic coalition formation for distributed task allocation among wireless agents"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "settling the complexity of local max cut almost completely"

Connected through hyperedge HE-4 (induced by source paper "pareto optimal coalitions of fixed size"):
  with members:
    - "simple causes of complexity in hedonic games"

Connected through hyperedge HE-5 (induced by source paper "strategyproof mechanisms for additively separable hedonic games and fractional hedonic games"):
  with members:
    - "mechanism design for team formation"
    - "simple causes of complexity in hedonic games"
    - "core stability in hedonic coalition formation"
    - "truthful assignment without money"

Connected through hyperedge HE-6 (induced by source paper "hedonic games with graph restricted communication"):
  with members:
    - "simple causes of complexity in hedonic games"

Connected through hyperedge HE-7 (induced by source paper "coordination games on graphs"):
  with members:
    - "social network games with obligatory product selection"
    - "existence of stability in hedonic coalition formation games"
    - "social network games"
    - "diffusion in social networks with competing products"
    - "optimal partitions in additively separable hedonic games"

Connected through hyperedge HE-8 (induced by source paper "computing stable outcomes in symmetric additively separable hedonic games"):
  with members:
    - "simple causes of complexity in hedonic games"
    - "settling the complexity of local max cut almost completely"
    - "computing the nucleolus of weighted voting games"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.GT(Computer Science and Game Theory)