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: "complexity of coalition structure generation"
  Abstract: We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types is bounded by a constant. As a corollary, we obtain a polynomial-time algorithm to compute an optimal partition for weighted voting games with a constant number of weight values and for coalitional skill games with a constant number of skills. We also consider well-studied and well-motivated coalitional games defined compactly on combinatorial domains. For these games, we characterize the complexity of computing an optimal coalition structure by presenting polynomial-time algorithms, approximation algorithms, or NP-hardness and inapproximability lower bounds.

Connected through hyperedge HE-1 (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"
    - "simple causes of complexity in hedonic games"
    - "coalition structure generation over graphs"
    - "an anytime algorithm for optimal coalition structure generation"

Connected through hyperedge HE-2 (induced by source paper "stable marriage with groups of similar agents"):
  with members:
    - "on treewidth and stable marriage"
    - "balanced stable marriage how close is close enough"
    - "stable marriage with covering constraints a complete computational trichotomy"
    - "parameterized integer quadratic programming variables and coefficients"
    - "the complexity of approximately counting stable roommate assignments"
    - "the complexity of approximately counting stable matchings"

Connected through hyperedge HE-3 (induced by source paper "fast algorithms for game theoretic centrality measures"):
  with members:
    - "a measure of synergy in coalitions"
    - "axioms for centrality"
    - "efficient computation of the shapley value for game theoretic network centrality"
    - "wiretapping a hidden network"

Connected through hyperedge HE-4 (induced by source paper "coalition structure generation over graphs"):
  with members:
    - "optimal coalition structures in graph games"
    - "an anytime algorithm for optimal coalition structure generation"

Connected through hyperedge HE-5 (induced by source paper "optimal coalition structures in cooperative graph games"):
  with members:
    - "graph coalition structure generation"
    - "the cost of stability in coalitional games"
    - "a note on the inapproximability of correlation clustering"

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)