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 "a parameterized perspective on protecting elections"):
  Abstract: We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and $k_d$ corresponding to respectively the number of voter groups the attacker can attack and the number of voter groups the defender can defend. A voter group gets removed from the election if it is attacked but not defended. In the optimal defense problem, we want to know if it is possible for the defender to commit to a strategy of defending at most $k_d$ voter groups such that, no matter which $k_a$ voter groups the attacker attacks, the outcome of the election does not change. In the optimal attack problem, we want to know if it is possible for the attacker to commit to a strategy of attacking $k_a$ voter groups such that, no matter which $k_d$ voter groups the defender defends, the outcome of the election is always different from the original (without any attack) one.

Includes members:
  Member "optimal bribery in voting":
    also connected through other hyperedges:
      (none)
  Member "manipulative elicitation a new attack on elections with incomplete preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity of manipulation with partial information in voting")
  Member "on the exact amount of missing information that makes finding possible winners hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of possible winners on partial chains")
  Member "complexity of manipulation with partial information in voting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of possible winners on partial chains")
  Member "frugal bribery in voting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "detecting possible manipulators in elections":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "manipulative elicitation a new attack on elections with incomplete preferences")
  Member "kernelization complexity of possible winner and coalitional manipulation problems in voting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "manipulating districts to win elections fine grained complexity")

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)