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 "online best reply algorithms for resource allocation problems"):
  Abstract: We study online resource allocation problems with a diseconomy of scale. In these problems, there are certain requests, each demanding a set of resources, that arrive in an online manner. The cost of each resource is semi-convex and grows superlinearly in the total load on the resource. An irrevocable allocation decision has to be made directly after the arrival of each request with the goal to minimize the total cost on the resources. We focus on two simple greedy online policies that provide very fast and easy approximation algorithms. #R##N#The first policy is to minimize the individual cost of the current online request with respect to all previous requests that have been allocated before. The second policy is to minimize the marginal total cost over all requests that have arrived up to this point. In the literature, these type of algorithms is also considered as one-round walks in congestion games starting from the empty state. #R##N#We consider the weighted and unweighted version of the problem. In the weighted variant, and for cost functions that are polynomials with maximal degree $d$ and positive coefficients, we proof a tight competitive ratio of $\left(\sqrt[d]{2}-1\right)^{-(d+1)}$ for the marginal total cost policy. This interestingly exactly matches the approximation factor for the corresponding \emph{multiple}-round walk algorithm. Our work indicates that one-round walks that start in an empty starting state are exactly as efficient as multiple-round walks. We also show that this does not carry over to the unweighted version of the problem. For unweighted instances, we provide lower bounds for both policies that are significantly larger than the corresponding multiple-round walks. We complement our results with an upper and lower bound on the solution quality of the personal cost policy for weighted and unweighted instances.

Includes members:
  Member "the price of stability of weighted congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "existence and complexity of approximate equilibria in weighted congestion games")
  Member "the robust price of anarchy of altruistic games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prior independent equilibria and linear multi dimensional bayesian games")
  Member "a unifying tool for bounding the quality of non cooperative solutions in weighted congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal mechanisms for distributed resource allocation")

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)