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 "stability of service under time of use pricing"):
  Abstract: We consider "time-of-use" pricing as a technique for matching supply and demand of temporal resources with the goal of maximizing social welfare. Relevant examples include energy, computing resources on a cloud computing platform, and charging stations for electric vehicles, among many others. A client/job in this setting has a window of time during which he needs service, and a particular value for obtaining it. We assume a stochastic model for demand, where each job materializes with some probability via an independent Bernoulli trial. Given a per-time-unit pricing of resources, any realized job will first try to get served by the cheapest available resource in its window and, failing that, will try to find service at the next cheapest available resource, and so on. Thus, the natural stochastic fluctuations in demand have the potential to lead to cascading overload events. Our main result shows that setting prices so as to optimally handle the {\em expected} demand works well: with high probability, when the actual demand is instantiated, the system is stable and the expected value of the jobs served is very close to that of the optimal offline algorithm.

Includes members:
  Member "near optimal online algorithms and fast approximation algorithms for resource allocation problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "truthful online scheduling with commitments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online revenue maximization for server pricing")
  Member "fast algorithms for online stochastic convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple and fast algorithm for binary integer and online linear programming")
  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 "primal beats dual on online packing lps in the random order model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random order models")
  Member "sequential posted pricing and multi parameter mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal auctions vs anonymous pricing beyond linear utility")
  Member "online stochastic packing applied to display ad allocation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "near optimal online algorithms and fast approximation algorithms for resource allocation problems")
  Member "a dynamic near optimal algorithm for online linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "random order models")

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)