human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "measuring majority power and veto power of voting rules"
  Abstract: We study voting rules with respect to how they allow or limit a majority to dominate minorities: whether a voting rule makes a majority powerful, and whether minorities can veto candidates that they do not prefer. For a given voting rule, the minimal share of voters that guarantees a victory to one of their most preferred candidates is the measure of majority power, and the minimal share of voters that allows to veto each of their least preferred candidates is the measure of veto power. We find tight bounds on these minimal shares for voting rules that are popular in the literature and real elections. We order these rules according to majority power and veto power. The instant-runoff rule has both the highest majority power and the highest veto power and the plurality rule has the lowest. In general, the higher majority power of a voting rule is, the higher is its veto power. The two exceptions are Black's rule and Borda rule that have a relatively low level of majority power and a high level of veto power and thus provide minority protection.

Connected through hyperedge HE-1 (induced by source paper "how should we score athletes and candidates geometric scoring rules"):
  with members:
    - "consistent approval based multi winner rules"
    - "axiomatic characterization of committee scoring rules"
    - "multiwinner approval rules as apportionment methods"

Question: Please tell me which class the center node 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)