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 segregation with strategic agents"
  Abstract: Schelling's segregation model is a landmark model in sociology. It shows the counter-intuitive phenomenon that residential segregation between individuals of different groups can emerge even when all involved individuals are tolerant. Although the model is widely studied, no pure game-theoretic version where rational agents strategically choose their location exists. We close this gap by introducing and analyzing generalized game-theoretic models of Schelling segregation, where the agents can also have individual location preferences. #R##N#For our models, we investigate the convergence behavior and the efficiency of their equilibria. In particular, we prove guaranteed convergence to an equilibrium in the version which is closest to Schelling's original model. Moreover, we provide tight bounds on the Price of Anarchy.

Connected through hyperedge HE-1 (induced by source paper "graphical one sided markets"):
  with members:
    - "schelling games on graphs"
    - "swap stability in schelling games on graphs"
    - "maximin share allocations on cycles"
    - "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:
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "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"
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "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 "convergence and hardness of strategic schelling segregation"):
  with members:
    - "schelling games on graphs"
    - "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-5 (induced by source paper "hedonic diversity games"):
  with members:
    - "schelling games on graphs"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "schelling games on graphs"):
  with members:
    - "hedonic diversity games"
    - "from randomness to order unperturbed schelling segregation in two or three dimensions"
    - "digital morphogenesis via schelling segregation"
    - "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)