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: "simple causes of complexity in hedonic games"
  Abstract: Hedonic games provide a natural model of coalition formation among self-interested agents. The associated problem of finding stable outcomes in such games has been extensively studied. In this paper, we identify simple conditions on expressivity of hedonic games that are sufficient for the problem of checking whether a given game admits a stable outcome to be computationally hard. Somewhat surprisingly, these conditions are very mild and intuitive. Our results apply to a wide range of stability concepts (core stability, individual stability, Nash stability, etc.) and to many known formalisms for hedonic games (additively separable games, games with W-preferences, fractional hedonic games, etc.), and unify and extend known results for these formalisms. They also have broader applicability: for several classes of hedonic games whose computational complexity has not been explored in prior work, we show that our framework immediately implies a number of hardness results for them.

Connected through hyperedge HE-1 (induced by source paper "pareto optimal coalitions of fixed size"):
  with members:
    - "stable partitions in additively separable hedonic games"

Connected through hyperedge HE-2 (induced by source paper "stable outcomes in modified fractional hedonic games"):
  with members:
    - "strategyproof mechanisms for additively separable hedonic games and fractional hedonic games"
    - "fractional hedonic games"
    - "mechanism design for team formation"
    - "coalition structure generation over graphs"
    - "complexity of coalition structure generation"
    - "an anytime algorithm for optimal coalition structure generation"

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

Connected through hyperedge HE-4 (induced by source paper "fractional hedonic games"):
  with members:
    - "hedonic games with graph restricted communication"
    - "network popularity and social cohesion a game theoretic approach"
    - "precise complexity of the core in dichotomous and additive hedonic games"

Connected through hyperedge HE-5 (induced by source paper "hedonic games with graph restricted communication"):
  with members:
    - "stable partitions in additively separable hedonic games"

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

Connected through hyperedge HE-7 (induced by source paper "precise complexity of the core in dichotomous and additive hedonic games"):
  with members:
    - "boolean hedonic games"
    - "core stability in hedonic coalition formation"
    - "stable partitions in additively separable hedonic 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)