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 "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms"):
  Abstract: We study one-sided matching mechanisms where agents have vNM utility functions and report ordinal preferences. We first show that in this domain strategyproof mechanisms are characterized by three intuitive axioms: swap consistency, weak invariance, and lower invariance. Our second result is that dropping lower invariance leads to an interesting new relaxation of strategyproofness, which we call partial strategyproofness. In particular, we show that mechanisms are swap consistent and weakly invariant if and only if they are strategyproof on a restricted domain where agents have sufficiently different valuations for different objects. Furthermore, we show that this domain restriction is maximal and use it to define a single-parameter measure for the degree of strategyproofness of a manipulable mechanism. We also provide an algorithm that computes this measure. Our new partial strategyproofness concept finds applications in the incentive analysis of non-strategyproof mechanisms, such as the Probabilistic Serial mechanism, different variants of the Boston mechanism, and the construction of new hybrid mechanisms.

Includes members:
  Member "hybrid mechanisms trading off efficiency and strategyproofness in one sided matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "investigating the characteristics of one sided matching mechanisms under various preferences and risk attitudes")
  Member "the naive versus the adaptive boston mechanism":
    also connected through other hyperedges:
      (none)
  Member "the computational complexity of random serial dictatorship":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "quantifying the strategyproofness of mechanisms via metrics on payoff distributions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing bayes nash equilibria in combinatorial auctions with verification")

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)