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: "core stability in hedonic coalition formation"
  Abstract: In many economic, social and political situations individuals carry out activities in groups (coalitions) rather than alone and on their own. Examples range from households and sport clubs to research networks, political parties and trade unions. The underlying game theoretic framework is known as coalition formation. #R##N#This survey discusses the notion of core stability in hedonic coalition formation (where each player's happiness only depends on the other members of his coalition but not on how the remaining players outside his coalition are grouped). We present the central concepts and algorithmic approaches in the area, provide many examples, and pose a number of open problems.

Connected through hyperedge HE-1 (induced by source paper "complexity of stability"):
  with members:
    - "finding optimal solutions with neighborly help"
    - "application of graph colouring to biological networks"
    - "exact complexity of exact four colorability"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-2 (induced by source paper "on the existence of three dimensional stable matchings with cyclic preferences"):
  with members:
    - "three dimensional stable matching with cyclic preferences"
    - "stable marriage with general preferences"

Connected through hyperedge HE-3 (induced by source paper "group activity selection on social networks"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "on parameterized complexity of group activity selection problems on social networks"
    - "fair division of a graph"
    - "hedonic games with graph restricted communication"
    - "complexity results for rainbow matchings"
    - "group activity selection problem"

Connected through hyperedge HE-4 (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"
    - "truthful assignment without money"
    - "stable partitions in additively separable hedonic games"

Connected through hyperedge HE-5 (induced by source paper "precise complexity of the core in dichotomous and additive hedonic games"):
  with members:
    - "boolean hedonic games"
    - "simple causes of complexity in hedonic games"
    - "stable partitions in additively separable hedonic games"

Connected through hyperedge HE-6 (induced by source paper "simple causes of complexity in hedonic games"):
  with members:
    - "stable marriage and roommate problems with individual based stability"
    - "existence of stability in hedonic coalition formation games"
    - "individual based stability in hedonic games depending on the best or worst players"

Connected through hyperedge HE-7 (induced by source paper "matching dynamics with constraints"):
  with members:
    - "socially stable matchings in the hospitals residents problem"
    - "locally stable marriage with strict preferences"
    - "social networks and stable matchings in the job market"

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)