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 "efficient two sided markets with limited information"):
  Abstract: Many important practical markets inherently involve the interaction of strategic buyers with strategic sellers. A fundamental impossibility result for such two-sided markets due to Myerson and Satterthwaite establishes that even in the simplest such market, that of bilateral trade, it is impossible to design a mechanism that is individually rational, truthful, (weakly) budget balanced, and efficient. Even worse, it is known that the "second best" mechanism$-$the mechanism that maximizes social welfare subject to the other constraints$-$has to be carefully tailored to the Bayesian priors and is extremely complex. #R##N#In light of this impossibility result it is very natural to seek "simple" mechanisms that are approximately optimal, and indeed a very active line of recent work has established a broad spectrum of constant-factor approximation guarantees, which apply to settings well beyond those for which (implicit) characterizations of the optimal (second best) mechanism are known. #R##N#In this work, we go one step further and show that for many fundamental two-sided markets$-$e.g., bilateral trade, double auctions, and combinatorial double auctions$-$it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a single sample from the priors! In fact, most of our results in addition to requiring less information also improve upon the best known approximation guarantees for the respective setting.

Includes members:
  Member "optimal single choice prophet inequalities from samples":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "bulow klemperer style results for welfare maximization in two sided markets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strongly budget balanced auctions for multi sided markets")
  Member "improved truthful mechanisms for combinatorial auctions with submodular bidders":
    also connected through other hyperedges:
      (none)
  Member "online trading as a secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how to hire secretaries with stochastic departures")
  Member "the best of both worlds asymptotically efficient mechanisms with a guarantee on the expected gains from trade":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bulow klemperer style results for welfare maximization in two sided markets")
  Member "approximating gains from trade in two sided markets via simple mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bulow klemperer style results for welfare maximization in two sided markets")
  Member "fixed price approximability of the optimal gain from trade":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi unit bilateral trade")
  Member "online market intermediation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal pricing for mhr and lambda regular distributions")

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)