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 hardness of bribery variants in voting with cp nets"):
  Abstract: We continue previous work by Mattei et al. (Ann. Math. Artif. Intell. 1042 68(1---3), 135---160 2013) in which they study the computational complexity of bribery schemes when voters have conditional preferences modeled as CP-nets. For most of the cases they considered, they showed that the bribery problem is solvable in polynomial time. Some cases remained open--we solve several of them and extend the previous results to the case that voters are weighted. Additionally, we consider negative (weighted) bribery in CP-nets, when the briber is not allowed to pay voters to vote for his preferred candidate.

Includes members:
  Member "campaign management under approval driven voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximation and hardness of shift bribery")
  Member "k best enumeration":
    also connected through other hyperedges:
      (none)
  Member "how hard is it to control an election by breaking ties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a parameterized perspective on protecting elections")
  Member "towards a dichotomy for the possible winner problem in elections based on scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of possible winners on partial chains")
  Member "approximation algorithms for campaign management":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal bribery in voting")
  Member "multivariate complexity analysis of swap bribery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal bribery in voting")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "selecting voting locations for fun and profit")
  Member "a richer understanding of the complexity of election systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computational social choice and computational complexity bffs")

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)