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 "almost efficient mechanisms for bilateral trading"):
  Abstract: We study the simplest form of two-sided markets: one seller, one buyer and a single item for sale. It is well known that there is no fully-efficient mechanism for this problem that maintains a balanced budget. We characterize the quality of the most efficient mechanisms that are budget balanced, and design simple and robust mechanisms with these properties. We also show that even minimal use of statistical data can yield good results. Finally, we demonstrate how a mechanism for this simple bilateral-trade problem can be used as a "black-box" for constructing mechanisms in more general environments.

Includes members:
  Member "approximating gains from trade in two sided markets via simple mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient two sided markets with limited information")
  Member "fixed price approximability of the optimal gain from trade":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient two sided markets with limited information")
  Member "a simple and approximately optimal mechanism for an additive buyer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "auctions with severely bounded communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mechanism design for multi party machine learning")

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)