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 "welfare maximization entices participation"):
  Abstract: We consider randomized mechanisms with optional participation. Preferences over lotteries are modeled using skew-symmetric bilinear (SSB) utility functions, a generalization of classic von Neumann-Morgenstern utility functions. We show that every welfare-maximizing mechanism entices participation and that the converse holds under additional assumptions. Two important corollaries of our results are characterizations of an attractive randomized voting rule that satisfies Condorcet-consistency and entices participation. This stands in contrast to a well-known result by Moulin (1988), who proves that no deterministic voting rule can satisfy both properties simultaneously.

Includes members:
  Member "arrovian aggregation of convex preferences":
    also connected through other hyperedges:
      (none)
  Member "condorcet s principle and the preference reversal paradox":
    also connected through other hyperedges:
      (none)
  Member "optimal bounds for the no show paradox via sat solving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "condorcet s principle and the preference reversal paradox")
  Member "consistent probabilistic social choice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consistent approval based multi winner rules")

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)