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: "schelling games on graphs"
  Abstract: We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in which case they will always choose their preferred location, or strategic, in which case they aim to maximize the fraction of agents of their own type in their neighborhood. We investigate the existence of equilibria in these games, study the complexity of finding an equilibrium outcome or an outcome with high social welfare, and also provide upper and lower bounds on the price of anarchy and stability. Some of our results extend to the setting where the preferences of the agents over their neighbors are defined by a social network rather than a partition into types.

Connected through hyperedge HE-1 (induced by source paper "graphical one sided markets"):
  with members:
    - "swap stability in schelling games on graphs"
    - "maximin share allocations on cycles"
    - "schelling segregation with strategic agents"
    - "fair allocation of indivisible items with externalities"
    - "almost envy free allocations with connected bundles"
    - "fair division of a graph"
    - "fair division via social comparison"
    - "efficient equilibria in polymatrix coordination games"

Connected through hyperedge HE-2 (induced by source paper "distributed pattern formation in a ring"):
  with members:
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "simple and efficient local codes for distributed stable network construction"
    - "an analysis of one dimensional schelling segregation"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

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

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

Connected through hyperedge HE-5 (induced by source paper "convergence and hardness of strategic schelling segregation"):
  with members:
    - "schelling segregation with strategic agents"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "unperturbed schelling segregation in two or three dimensions"
    - "digital morphogenesis via schelling segregation"
    - "an analysis of one dimensional schelling segregation"

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

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)