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 "election attacks with few candidates"):
  Abstract: We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most of the generalized scoring rules, with respect to the number of candidates. Our results imply that all these strategic voting problems are fixed-parameter tractable for most of the common voting rules, such as Plurality, r-Approval, Borda, Copeland, Maximin, Bucklin, etc., with respect to the number of candidates.

Includes members:
  Member "coalitional manipulation for schulze s rule":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a note on the complexity of manipulating weighted schulze voting")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "the schulze method of voting")
  Member "a smooth transition from powerlessness to absolute power":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how private is your voting a framework for comparing the privacy of voting mechanisms")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "is computational complexity a barrier to manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "detecting possible manipulators in elections")
  Member "multivariate complexity analysis of swap bribery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal bribery in voting")
  Member "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a parameterized perspective on protecting elections")

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.GT(Computer Science and Game Theory)