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 "on the computational complexity of variants of combinatorial voter control in elections"):
  Abstract: Voter control problems model situations in which an external agent tries toaffect the result of an election by adding or deleting the fewest number of voters. The goal of the agent is to make a specific candidate either win (\emph{constructive} control) or lose (\emph{destructive} control) the election. We study the constructive and destructive voter control problems whenadding and deleting voters have a \emph{combinatorial flavor}: If we add (resp.\ delete) a voter~$v$, we also add (resp.\ delete) a bundle~$\kappa(v) $ of voters that are associated with~$v$. While the bundle~$\kappa(v)$ may have more than one voter, a voter may also be associated with more than one voter. We analyze the computational complexity of the four voter control problems for the Plurality rule. We obtain that, in general, making a candidate lose is computationally easier than making her win. In particular, if the bundling relation is symmetric (i.e.\ $\forall w\colon w \in \kappa(v) \Leftrightarrow v \in \kappa(w) $), and if each voter has at most two voters associated with him, then destructive control is polynomial-time solvable while the constructive variant remains $\NP$-hard. Even if the bundles are disjoint (i.e.\ $\forall w\colon w \in \kappa(v) \Leftrightarrow \kappa(v) = \kappa(w) $), the constructive problem variants remain intractable. Finally, the minimization variant of constructive control by adding voters does not admit an efficient approximation algorithm, unless P=NP.

Includes members:
  Member "elections with few voters candidate control can be easy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "parameterized algorithmics for computational social choice nine research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable marriage with multi modal preferences")
  Member "combinatorial voter control in elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selecting voting locations for fun and profit")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "selecting voting locations for fun and profit")
  Member "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the schulze method of voting")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "anyone but him the complexity of precluding an alternative":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selecting voting locations for fun and profit")

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)