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 "determining possible and necessary winners under common voting rules given partial orders"):
  Abstract: Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial orders instead. Then, given a voting rule, a profile of partial orders, and an alternative (candidate) c, two important questions arise: first, is it still possible for c to win, and second, is c guaranteed to win? These are the possible winner and necessary winner problems, respectively. Each of these two problems is further divided into two sub-problems: determining whether c is a unique winner (that is, c is the only winner), or determining whether c is a co-winner (that is, c is in the set of winners).#R##N##R##N#We consider the setting where the number of alternatives is unbounded and the votes are unweighted. We completely characterize the complexity of possible/necessary winner problems for the following common voting rules: a class of positional scoring rules (including Borda), Copeland, maximin, Bucklin, ranked pairs, voting trees, and plurality with runoff.

Includes members:
  Member "common voting rules as maximum likelihood estimators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "new candidates welcome possible winners with respect to the addition of new candidates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  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-3 (induced by source paper "the complexity of possible winners on partial chains")
  Member "towards a dichotomy for the possible winner problem in elections based on scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of possible winners on partial chains")
  Member "the complexity of probabilistic lobbying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal bribery in voting")
  Member "manipulating tournaments in cup and round robin competitions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "refining tournament solutions via margin of victory")
  Member "eliciting single peaked preferences using comparison queries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "swap dynamics in single peaked house markets")
  Member "dichotomy for voting systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of online bribery in sequential 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)