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: "existence of stability in hedonic coalition formation games"
  Abstract: In this paper, we examine \emph{hedonic coalition formation games} in which each player's preferences over partitions of players depend only on the members of his coalition. We present three main results in which restrictions on the preferences of the players guarantee the existence of stable partitions for various notions of stability. The preference restrictions pertain to \emph{top responsiveness} and \emph{bottom responsiveness} which model optimistic and pessimistic behavior of players respectively. The existence results apply to natural subclasses of \emph{additive separable hedonic games} and \emph{hedonic games with \B-preferences}. It is also shown that our existence results cannot be strengthened to the case of stronger known stability concepts.

Connected through hyperedge HE-1 (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"
    - "a classification of weakly acyclic games"
    - "on dynamics in selfish network creation"
    - "social network games"
    - "diffusion in social networks with competing products"

Connected through hyperedge HE-2 (induced by source paper "anonymous hedonic game for task allocation in a large scale multiple agent system"):
  with members:
    - "group activity selection problem"
    - "hedonic coalition formation for distributed task allocation among wireless agents"

Connected through hyperedge HE-3 (induced by source paper "quantifying inefficiency of fair cost sharing mechanisms for sharing economy"):
  with members:
    - "sharing non anonymous costs of multiple resources optimally"
    - "strategic cooperation in cost sharing games"

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

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

Connected through hyperedge HE-6 (induced by source paper "on the nash stability in the hedonic coalition formation games"):
  with members:
    - "a generic approach to coalition formation"

Connected through hyperedge HE-7 (induced by source paper "a game theoretic approach to distributed coalition formation in energy aware cloud federations extended version"):
  with members:
    - "on the nash stability in the hedonic coalition formation games"
    - "hedonic coalition formation for distributed task allocation among wireless agents"
    - "coalition formation games for distributed cooperation among roadside units in vehicular networks"
    - "a generic approach to coalition formation"

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)