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 "smoothed and average case approximation ratios of mechanisms beyond the worst case analysis"):
  Abstract: The approximation ratio has become one of the dominant measures in mechanism design problems. In light of analysis of algorithms, we define the \emph{smoothed approximation ratio} to compare the performance of the optimal mechanism and a truthful mechanism when the inputs are subject to random perturbations of the worst-case inputs, and define the \emph{average-case approximation ratio} to compare the performance of these two mechanisms when the inputs follow a distribution. For the one-sided matching problem, \citet{FFZ:14} show that, amongst all truthful mechanisms, \emph{random priority} achieves the tight approximation ratio bound of $\Theta(\sqrt{n})$. We prove that, despite of this worst-case bound, random priority has a \emph{constant smoothed approximation ratio}. This is, to our limited knowledge, the first work that asymptotically differentiates the smoothed approximation ratio from the worst-case approximation ratio for mechanism design problems. For the average-case, we show that our approximation ratio can be improved to $1+e$. These results partially explain why random priority has been successfully used in practice, although in the worst case the optimal social welfare is $\Theta(\sqrt{n})$ times of what random priority achieves. These results also pave the way for further studies of smoothed and average-case analysis for approximate mechanism design problems, beyond the worst-case analysis.

Includes members:
  Member "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "mix and match":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "facility location with double peaked preference")
  Member "truthful assignment without money":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "settling the complexity of computing two player nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning zero sum simultaneous move markov games using function approximation and correlated equilibrium")
  Member "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improper learning for non stochastic control")

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)