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 "x then x manipulation of same system runoff elections"):
  Abstract: Do runoff elections, using the same voting rule as the initial election but just on the winning candidates, increase or decrease the complexity of manipulation? Does allowing revoting in the runoff increase or decrease the complexity relative to just having a runoff without revoting? For both weighted and unweighted voting, we show that even for election systems with simple winner problems the complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are independent, in the abstract. On the other hand, for some important, well-known election systems we determine what holds for each of these cases. For no such systems do we find runoffs lowering complexity, and for some we find that runoffs raise complexity. Ours is the first paper to show that for natural, unweighted election systems, runoffs can increase the manipulation complexity.

Includes members:
  Member "search versus decision for election manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the power of self reducibility selectivity information and approximation")
  Member "an atypical survey of typical case heuristic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "eliminating the weakest link making manipulation intractable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "where are the really hard manipulation problems the phase transition in manipulating the veto rule":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deceased organ matching in australia")
  Member "a richer understanding of the complexity of election systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computational social choice and computational complexity bffs")
  Member "dichotomy for voting systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of online bribery in sequential elections")
  Member "anyone but him the complexity of precluding an alternative":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selecting voting locations for fun and profit")
  Member "universal voting protocol tweaks to make manipulation hard":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure voting protocols with perfect ballot secrecy")

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)