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: "hedonic games with graph restricted communication"
  Abstract: We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the complexity of finding stable outcomes in such games, for several notions of stability. In particular, we provide an efficient algorithm that finds an individually stable partition for an arbitrary hedonic game on an acyclic graph. We also introduce a new stability concept -in-neighbor stability- which is tailored for our setting. We show that the problem of finding an in-neighbor stable outcome admits a polynomial-time algorithm if the underlying graph is a path, but is NP-hard for arbitrary trees even for additively separable hedonic games; for symmetric additively separable games we obtain a PLS-hardness result.

Connected through hyperedge HE-1 (induced by source paper "hedonic seat arrangement problems"):
  with members:
    - "graphical one sided markets"
    - "computational complexity of hedonic games on sparse graphs"
    - "tight lower bounds on graph embedding problems"

Connected through hyperedge HE-2 (induced by source paper "a learning framework for distribution based game theoretic solution concepts"):
  with members:
    - "forming probably stable communities with limited interactions"
    - "envy free classification"
    - "statistical cost sharing"
    - "a sample complexity measure with applications to learning optimal auctions"
    - "learning simple auctions"
    - "sample complexity of automated mechanism design"
    - "learning cooperative games"
    - "the sample complexity of auctions with side information"

Connected through hyperedge HE-3 (induced by source paper "hedonic diversity games"):
  with members:
    - "schelling games on graphs"
    - "schelling segregation with strategic agents"
    - "fractional hedonic games"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-4 (induced by source paper "robustness against agent failure in hedonic games"):
  with members:
    - "group activity selection on social networks"
    - "learning cooperative games"
    - "group activity selection problem"
    - "solving cooperative reliability games"

Connected through hyperedge HE-5 (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"
    - "complexity results for rainbow matchings"
    - "group activity selection problem"
    - "core stability in hedonic coalition formation"

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

Connected through hyperedge HE-7 (induced by source paper "on parameterized complexity of group activity selection problems on social networks"):
  with members:
    - "group activity selection on social networks"
    - "group activity selection problem"

Connected through hyperedge HE-8 (induced by source paper "cooperative games with overlapping coalitions charting the tractability frontier"):
  with members:
    - "on parameterized complexity of group activity selection problems on social networks"
    - "group activity selection on social networks"
    - "coalition games on interaction graphs a horticultural perspective"
    - "the authorship dilemma alphabetical or contribution"
    - "on the complexity of core kernel and bargaining set"
    - "cooperative games with overlapping coalitions"
    - "an anytime algorithm for optimal coalition structure generation"
    - "the cost of stability in coalitional 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)