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 "online trading as a secretary problem"):
  Abstract: We consider the online problem in which an intermediary trades identical items with a sequence of n buyers and n sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-from-trade.

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 "online market intermediation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient two sided markets with limited information")
  Member "sbba a strongly budget balanced double auction mechanism":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient two sided markets with limited information")
  Member "combinatorial auctions via posted prices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "algorithms for secretary problems on graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random order models")

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)