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 "multi parameter auctions with online supply"):
  Abstract: We study a basic auction design problem with online supply. There are two unit-demand bidders and two types of items. The first item type will arrive first for sure, and the second item type may or may not arrive. The auctioneer has to decide the allocation of an item immediately after each item arrives, but is allowed to compute payments after knowing how many items arrived. For this problem we show that there is no deterministic truthful and individually rational mechanism that, even with unbounded computational resources, gets any finite approximation factor to the optimal social welfare. #R##N#The basic multi-parameter online supply model that we study opens the space for several interesting questions about the power of randomness. There are three prominent sources of randomness: 1) Randomized mechanisms, 2) Stochastic arrival. 3) Bayesian setting (values drawn from a distribution). For each of these sources of randomness, without using the other sources of randomness, what is the optimal approximation factor one can get? The currently known best approximation factors to optimal social welfare for none of these settings is better than $\max\{n,m\}$ where $n$ is the number of bidders and $m$ is the number of items.

Includes members:
  Member "the power of randomness in bayesian optimal mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "auctions with online supply":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truthful multi parameter auctions with online supply an impossible combination")
  Member "online stochastic matching beating 1 1 e":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online graph matching problems with a worst case reassignment budget")

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)