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 "fully proportional representation as resource allocation approximability results"):
  Abstract: We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (briefly put, these variants correspond to optimizing total voter satisfaction under Borda scores, within Monroe's and Chamberlin and Courant's voting systems).

Includes members:
  Member "group activity selection problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robustness against agent failure in hedonic games")
  Member "on the computation of fully proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)