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 expanding approvals rule improving proportional representation and monotonicity"):
  Abstract: Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the solution for achieving PR. Some of the most prominent electoral reform movements around the globe are pushing for the adoption of STV. It has been termed a major open problem to design a voting rule that satisfies the same PR properties as STV and better monotonicity properties. In this paper, we first present a taxonomy of proportional representation axioms for general weak order preferences, some of which generalise and strengthen previously introduced concepts. We then present a rule called Expanding Approvals Rule (EAR) that satisfies properties stronger than the central PR axiom satisfied by STV, can handle indifferences in a convenient and computationally efficient manner, and also satisfies better candidate monotonicity properties. In view of this, our proposed rule seems to be a compelling solution for achieving proportional representation in voting settings.

Includes members:
  Member "fair knapsack":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "developments in multi agent fair allocation")
  Member "a framework for approval based budgeting methods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "who is in your top three optimizing learning in elections with many candidates")
  Member "the condorcet principle for multiwinner elections from shortlisting to proportionality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportionally representative participatory budgeting with ordinal preferences")
  Member "proportionally representative participatory budgeting axioms and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "participatory budgeting models and approaches")
  Member "monotonicity axioms in approval based multi winner voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "committees providing ejr can be computed efficiently":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approval based apportionment")
  Member "the maximin support method an extension of the d hondt method to approval based multiwinner elections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a quantitative analysis of multi winner rules")
  Member "computational complexity of testing proportional justified representation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proportionally representative participatory budgeting axioms and algorithms")

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)