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 with multi modal preferences"):
  Abstract: We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one "evaluation mode" (e.g., more than one criterion); thus, each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way. We introduce and study three natural concepts of stability, investigate their mutual relations and focus on computational complexity aspects with respect to computing stable matchings in these new scenarios. Mostly encountering computational hardness (NP-hardness), we can also spot few islands of tractability and make a surprising connection to the \textsc{Graph Isomorphism} problem.

Includes members:
  Member "stable roommates with narcissistic single peaked and single crossing preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "a polynomial time randomized reduction from tournament isomorphism to tournament asymmetry":
    also connected through other hyperedges:
      (none)
  Member "stable matching with uncertain linear preferences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "assessing the computational complexity of multi layer subgraph detection":
    also connected through other hyperedges:
      (none)
  Member "the one dimensional euclidean domain finitely many obstructions are not enough":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "are there any nicely structured preference profiles nearby":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "parameterized algorithmics for computational social choice nine research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mixed integer programming with convex concave constraints fixed parameter tractability and applications to multicovering and voting")
  Member "stable marriage with general preferences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the existence of three dimensional stable matchings with cyclic preferences")

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.MA(Multiagent Systems)