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 "rank maximal equal contribution a probabilistic social choice function"):
  Abstract: When aggregating preferences of agents via voting, two desirable goals are to incentivize agents to participate in the voting process and then identify outcomes that are Pareto efficient. We consider participation as formalized by Brandl, Brandt, and Hofbauer (2015) based on the stochastic dominance (SD) relation. We formulate a new rule called RMEC (Rank Maximal Equal Contribution) that satisfies the strongest notion of participation and is also ex post efficient. The rule is polynomial-time computable and also satisfies many other desirable fairness properties. The rule suggests a general approach to achieving ex post efficiency and very strong participation.

Includes members:
  Member "randomized social choice functions under metric preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how good is a two party election game")
  Member "consistent probabilistic social choice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consistent approval based multi winner rules")
  Member "welfare maximization entices participation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "arrovian aggregation via pairwise utilitarianism")
  Member "the computational complexity of random serial dictatorship":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")

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)