human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "hedonic diversity games"):
  Abstract: We consider a coalition formation setting where each agent belongs to one of the two types, and agents' preferences over coalitions are determined by the fraction of the agents of their own type in each coalition. This setting differs from the well-studied Schelling's model in that some agents may prefer homogeneous coalitions, while others may prefer to be members of a diverse group, or a group that mostly consists of agents of the other type. We model this setting as a hedonic game and investigate the existence of stable outcomes using hedonic games solution concepts. We show that a core stable outcome may fail to exist and checking the existence of core stable outcomes is computationally hard. On the other hand, we propose an efficient algorithm to find an individually stable outcome under the natural assumption that agents' preferences over fractions of the agents of their own type are single-peaked.

Includes members:
  Member "schelling games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graphical one sided markets")
  Member "schelling segregation with strategic agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graphical one sided markets")
  Member "fractional hedonic games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "swap stability in schelling games on graphs")
  Member "hedonic games with graph restricted communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hedonic seat arrangement problems")
  Member "exponential segregation in a two dimensional schelling model with tolerant individuals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "positive algorithmic bias cannot stop fragmentation in homophilic social networks")
  Member "an analysis of one dimensional schelling segregation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "positive algorithmic bias cannot stop fragmentation in homophilic social networks")

Question: Please tell me which class the source paper 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)