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 "combinatorial voter control in elections"):
  Abstract: Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added one at a time, with the goal of making a distinguished alternative win by adding a minimum number of voters. In this paper, we initiate the study of combinatorial variants of control by adding voters: In our setting, when we choose to add a voter~$v$, we also have to add a whole bundle $\kappa(v)$ of voters associated with $v$. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.

Includes members:
  Member "prices matter for the parameterized complexity of shift bribery":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal bribery in voting")
  Member "elections with few voters candidate control can be easy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "more natural models of electoral control by partition":
    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 "control complexity in bucklin fallback and plurality voting an experimental approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity dichotomies for unweighted scoring rules")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "clone structures in voters preferences":
    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.MA(Multiagent Systems)