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 "welfare maximization with production costs a primal dual approach"):
  Abstract: We study online combinatorial auctions with production costs proposed by Blum et al. using the online primal dual framework. In this model, buyers arrive online, and the seller can produce multiple copies of each item subject to a non-decreasing marginal cost per copy. The goal is to allocate items to maximize social welfare less total production cost. For arbitrary (strictly convex and differentiable) production cost functions, we characterize the optimal competitive ratio achievable by online mechanisms/algorithms. We show that online posted pricing mechanisms, which are incentive compatible, can achieve competitive ratios arbitrarily close to the optimal, and construct lower bound instances on which no online algorithms, not necessarily incentive compatible, can do better. Our positive results improve or match the results in several previous work, e.g., Bartal et al., Blum et al., and Buchbinder and Gonen. Our lower bounds apply to randomized algorithms and resolve an open problem by Buchbinder and Gonen.

Includes members:
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "fast algorithms for online stochastic convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple and fast algorithm for binary integer and online linear programming")
  Member "a rational convex program for linear arrow debreu markets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional dynamics in exchange economies")
  Member "limitations of randomized mechanisms for combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "online primal dual for non linear optimization with applications to speed scaling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "station assignment with reallocation")
  Member "welfare and profit maximization with production costs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reducing inefficiency in carbon auctions with imperfect competition")
  Member "from convex optimization to randomized mechanisms toward optimal combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "market equilibrium with transaction costs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust market equilibria with uncertain preferences")

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)