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 "arrovian aggregation via pairwise utilitarianism"):
  Abstract: We consider Arrovian aggregation of preferences over lotteries that are represented by skew-symmetric bilinear (SSB) utility functions, a significant generalization of von Neumann-Morgenstern utility functions due to Fishburn, in which utility is assigned to pairs of alternatives. We show that the largest domain of preferences that simultaneously allows for independence of irrelevant alternatives and Pareto optimality when comparing lotteries based on accumulated SSB welfare is a domain in which preferences over lotteries are completely determined by ordinal preferences over pure alternatives. In particular, a lottery is preferred to another lottery if and only if the former is more likely to return a preferred alternative. Preferences over pure alternatives are unrestricted. We argue that SSB welfare maximization for this domain constitutes an appealing probabilistic social choice function.

Includes members:
  Member "consistent probabilistic social choice":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistent approval based multi winner rules")
  Member "welfare maximization entices participation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rank maximal equal contribution a probabilistic social choice function")
  Member "set rationalizable choice and self stability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "consistent probabilistic social choice")

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)