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 "revenue gaps for static and dynamic posted pricing of homogeneous goods"):
  Abstract: We consider the problem of maximizing the expected revenue from selling $k$ homogeneous goods to $n$ unit-demand buyers who arrive sequentially with independent and identically distributed valuations. In this setting the optimal posted prices are dynamic in the sense that they depend on the remaining numbers of goods and buyers, and may be difficult to implement due to technical or regulatory restrictions. We thus investigate how much revenue is lost when a single static price is used instead for all buyers and goods, and prove upper bounds on the ratio between the maximum revenue from dynamic prices and that from static prices. These bounds turn out to be tight for all values of $k$ and $n$ and vary depending on a regularity property of the underlying distribution. For general distributions we obtain a ratio of $2-k/n$, for regular distributions a ratio that increases in $n$ and is bounded from above by $1/(1-k^k/(e^{k}k!))$, which is of order $1/(1-1/\sqrt{k})$. The lower bounds hold for the revenue gap between dynamic and static prices. The upper bounds are obtained via an ex-ante relaxation of the revenue maximization problem, as a consequence the tight bounds of $2-k/n$ in the general case and of order $1/(1-1/\sqrt{k})$ in the regular case apply also to the potentially larger revenue gap between the optimal incentive-compatible mechanism and the optimal static price.

Includes members:
  Member "prophet secretary for combinatorial auctions and matroids":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "combinatorial prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "beyond matroids secretary problem and prophet inequality with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "optimal auctions vs anonymous pricing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "optimal competitive auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "benchmark design and prior independent optimization")
  Member "simple and near optimal mechanisms for market intermediation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient two sided markets with limited information")
  Member "combinatorial auctions via posted prices":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "prophet inequalities with linear correlations and augmentations")

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)