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 "stable marriage and roommate problems with individual based stability"):
  Abstract: Research regarding the stable marriage and roommate problem has a long and distinguished history in mathematics, computer science and economics. Stability in this context is predominantly core stability or one of its variants in which each deviation is by a group of players. There has been little focus in matching theory on stability concepts such as Nash stability and individual stability in which the deviation is by a single player. Such stability concepts are suitable especially when trust for the other party is limited, complex coordination is not feasible, or when only unmatched agents can be approached. Furthermore, weaker stability notions such as individual stability may in principle circumvent the negative existence and computational complexity results in matching theory. We characterize the computational complexity of checking the existence and computing individual-based stable matchings for the marriage and roommate settings. One of our key computational results for the stable marriage setting also carries over to different classes of hedonic games for which individual-based stability has already been of much interest.

Includes members:
  Member "individual based stability in hedonic games depending on the best or worst players":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simple causes of complexity in hedonic games")
  Member "stable partitions in additively separable hedonic games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing egalitarian value in k coalitional hedonic games")

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)