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 "prices matter for the parameterized complexity of shift bribery"):
  Abstract: In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate $p$, and a budget. The goal is to ensure that $p$ wins by shifting $p$ higher in some voters' preference orders. However, each such shift request comes at a price (depending on the voter and on the extent of the shift) and we must not exceed the given budget. We study the parameterized computational complexity of Shift Bribery with respect to a number of parameters (pertaining to the nature of the solution sought and the size of the election) and several classes of price functions. When we parameterize Shift Bribery by the number of affected voters, then for each of our voting rules (Borda, Maximin, Copeland) the problem is W[2]-hard. If, instead, we parameterize by the number of positions by which $p$ is shifted in total,then the problem is fixed-parameter tractable for Borda and Maximin,and is W[1]-hard for Copeland. If we parameterize by the budget, then the results depend on the price function class. We also show that Shift Bribery tends to be tractable when parameterized by the number of voters, but that the results for the number of candidates are more enigmatic.

Includes members:
  Member "complexity of shift bribery in committee elections":
    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 "parliamentary voting procedures agenda control manipulation and uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "advances in machine learning for the behavioral sciences")
  Member "campaign management under approval driven voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximation and hardness of shift bribery")
  Member "elections with few voters candidate control can be easy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "stable marriage with multi modal preferences")
  Member "combinatorial voter control in elections":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "selecting voting locations for fun and profit")
  Member "determining possible and necessary winners under common voting rules given partial orders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of possible winners on partial chains")
  Member "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of possible winners on partial chains")

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)