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 roommates with narcissistic single peaked and single crossing preferences"):
  Abstract: The classical Stable Roommates problem asks whether it is possible to have a matching of an even number of agents such that no two agents which are not matched to each other would prefer to be with each other rather than with their assigned partners. We investigate Stable Roommates with complete (i.e., every agent can be matched with any other agent) or incomplete preferences, with ties (i.e., two agents are considered of equal value to some agent) or without ties. It is known that in general allowing ties makes the problem NP-complete. We provide algorithms for Stable Roommates that are, compared to those in the literature, more efficient when the input preferences are complete and have some structural property, such as being narcissistic, single-peaked, and single-crossing. However, when the preferences are incomplete and have ties, we show that being single-peaked and single-crossing does not reduce the computational complexity-Stable Roommates remains NP-complete.

Includes members:
  Member "matchings under preferences strength of stability and trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "stable marriage with multi modal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "stable marriage with groups of similar agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters")
  Member "how hard is it to satisfy almost all roommates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "balanced stable marriage how close is close enough":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computational complexity of stable marriage and stable roommates and their variants")
  Member "stable marriage with covering constraints a complete computational trichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters")
  Member "modeling single peakedness for votes with ties":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "single peaked consistency for weak orders is easy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "incomplete preferences in single peaked electorates")

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)