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 "social welfare in one sided matching mechanisms"):
  Abstract: We study the Price of Anarchy of mechanisms for the well-known problem of one-sided matching, or house allocation, with respect to the social welfare objective. We consider both ordinal mechanisms, where agents submit preference lists over the items, and cardinal mechanisms, where agents may submit numerical values for the items being allocated. We present a general lower bound of $\Omega(\sqrt{n})$ on the Price of Anarchy, which applies to all mechanisms. We show that two well-known mechanisms, Probabilistic Serial, and Random Priority, achieve a matching upper bound. We extend our lower bound to the Price of Stability of a large class of mechanisms that satisfy a common proportionality property, and show stronger bounds on the Price of Anarchy of all deterministic mechanisms.

Includes members:
  Member "size versus truthfulness in the house allocation problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tradeoffs between information and ordinal approximation for bipartite matching")
  Member "manipulating the probabilistic serial rule":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "equilibria under the probabilistic serial rule":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "investigating the characteristics of one sided matching mechanisms under various preferences and risk attitudes")
  Member "efficiency of truthful and symmetric mechanisms in one sided matching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "selfish robustness and equilibria in multi player bandits")
  Member "strategic aspects of the probabilistic serial rule for the allocation of goods":
    also connected through other hyperedges:
      (none)
  Member "social welfare in one sided matchings random priority and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "keeping your friends close land allocation with friends")
  Member "welfare maximization and truthfulness in mechanism design with ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "assortment auctions a myersonian characterization for markov chain based choice models")
  Member "truthful approximations to range voting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "truthful ownership transfer with expert advice blending mechanism design with and without money")

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)