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 "dynamic pricing under a static calendar"):
  Abstract: This work is motivated by our collaboration with a large Consumer Packaged Goods (CPG) company. We have found that while they appreciate the advantages of dynamic pricing, they deem it operationally much easier to plan out a static price calendar in advance.#R##N##R##N#In this paper, we investigate the efficacy of static control policies for dynamic revenue management problems. In these problems, a firm has limited inventory to sell over a finite time horizon where demand is known but stochastic. We consider both pricing and assortment controls, and derive simple static policies in the form of a price calendar or a planned sequence of assortments, respectively. We show that our policies are within 1-1/e (approximately 0.63) of the optimum under stationary (IID) demand, and 1/2 of optimum under non-stationary demand, with both guarantees approaching 1 if the starting inventory is large.#R##N##R##N#A main contribution of this work is developing a system of tools for establishing best-possible performance guarantees relative to linear programming relaxations: in the stationary setting, structural properties about static policies which provide a complete characterization of tight bounds; and in the non-stationary setting, an adaptation of the prophet inequalities from optimal stopping theory to pricing and assortment problems.#R##N##R##N#Finally, we demonstrate on data from the CPG company that our simple price calendars are effective.

Includes members:
  Member "inventory balancing with online learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on policies for single leg revenue management with limited demand information")
  Member "on policies for single leg revenue management with limited demand information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "assortment auctions a myersonian characterization for markov chain based choice models")
  Member "mnl bandit a dynamic learning approach to assortment selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "combinatorial bandits with relative feedback")
  Member "combinatorial auctions via posted prices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "predict and match prophet inequalities with uncertain supply")

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.DS(Data Structures and Algorithms)