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 "the complexity of fully proportional representation for single crossing electorates"):
  Abstract: We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules---Chamberlin--Courant's rule and Monroe's rule. Winner determination for these rules is known to be NP-hard for unrestricted preferences. We show that for single-crossing preferences this problem admits a polynomial-time algorithm for Chamberlin--Courant's rule, but remains NP-hard for Monroe's rule. Our algorithm for Chamberlin--Courant's rule can be modified to work for elections with bounded single-crossing width. To circumvent the hardness result for Monroe's rule, we consider single-crossing elections that satisfy an additional constraint, namely, ones where each candidate is ranked first by at least one voter (such elections are called narcissistic). For single-crossing narcissistic elections, we provide an efficient algorithm for the egalitarian version of Monroe's rule.

Includes members:
  Member "properties of multiwinner voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who is in your top three optimizing learning in elections with many candidates")
  Member "approximating the maxcover problem with bounded frequencies in fpt time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized algorithmics for computational social choice nine research challenges")
  Member "on the computation of fully proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "achieving fully proportional representation is easy in practice":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "can we reach pareto optimal outcomes using bottom up approaches")
  Member "fully proportional representation as resource allocation approximability results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proportional representation in vote streams")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "clone structures in voters preferences":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incomplete preferences in single peaked electorates")

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)