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: "fractional hedonic games"
  Abstract: The work we present in this paper initiated the formal study of fractional hedonic games, coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings, this covers situations in which players only distinguish between friends and non-friends and desire to be in a coalition in which the fraction of friends is maximal. Fractional hedonic games thus not only constitute a natural class of succinctly representable coalition formation games, but also provide an interesting framework for network clustering. We propose a number of conditions under which the core of fractional hedonic games is non-empty and provide algorithms for computing a core stable outcome. By contrast, we show that the core may be empty in other cases, and that it is computationally hard in general to decide non-emptiness of the core.

Connected through hyperedge HE-1 (induced by source paper "swap stability in schelling games on graphs"):
  with members:
    - "convergence and hardness of strategic schelling segregation"
    - "graphical one sided markets"
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "from randomness to order unperturbed schelling segregation in two or three dimensions"
    - "digital morphogenesis via schelling segregation"

Connected through hyperedge HE-2 (induced by source paper "individual based stability in hedonic diversity games"):
  with members:
    - "convergence and hardness of strategic schelling segregation"
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "on the likelihood of single peaked preferences"
    - "generating single peaked votes"
    - "eliciting single peaked preferences using comparison queries"

Connected through hyperedge HE-3 (induced by source paper "hedonic diversity games"):
  with members:
    - "schelling games on graphs"
    - "schelling segregation with strategic agents"
    - "hedonic games with graph restricted communication"
    - "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 "stable outcomes in modified fractional hedonic games"):
  with members:
    - "strategyproof mechanisms for additively separable hedonic games and fractional hedonic games"
    - "mechanism design for team formation"
    - "simple causes of complexity in hedonic games"
    - "coalition structure generation over graphs"
    - "complexity of coalition structure generation"
    - "an anytime algorithm for optimal coalition structure generation"

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)