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: "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.

Connected through hyperedge HE-1 (induced by source paper "rank maximal equal contribution a probabilistic social choice function"):
  with members:
    - "randomized social choice functions under metric preferences"
    - "consistent probabilistic social choice"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-2 (induced by source paper "arrovian aggregation via pairwise utilitarianism"):
  with members:
    - "consistent probabilistic social choice"
    - "set rationalizable choice and self stability"

Connected through hyperedge HE-3 (induced by source paper "optimal bounds for the no show paradox via sat solving"):
  with members:
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "a sat attack on the erdos discrepancy conjecture"
    - "automated reasoning in social choice theory some remarks"
    - "complexity of mechanism design"
    - "automated search for impossibility theorems in social choice theory ranking sets of objects"
    - "set monotonicity implies kelly strategyproofness"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-4 (induced by source paper "participation incentives in randomized social choice"):
  with members:
    - "allocation of divisible goods under lexicographic preferences"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-5 (induced by source paper "consistent probabilistic social choice"):
  with members:
    - "set rationalizable choice and self stability"

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)