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 "efficient black box reductions for separable cost sharing"):
  Abstract: In cost sharing games with delays, a set of agents jointly allocates a finite subset of resources. Each resource has a fixed cost that has to be shared by the players, and each agent has a nonshareable player-specific delay for each resource. A prominent example is uncapacitated facility location (UFL), where facilities need to be opened (at a shareable cost) and clients want to connect to opened facilities. Each client pays a cost share and his non-shareable physical connection cost. Given any profile of subsets allocated by the agents, a separable cost sharing protocol determines cost shares that satisfy budget balance on every resource and separability over the resources. Moreover, a separable protocol guarantees existence of pure Nash equilibria in the induced strategic game for the agents. In this paper, we study separable cost sharing protocols in several general combinatorial domains. We provide black-box reductions to reduce the design of a separable cost-sharing protocol to the design of an approximation algorithm for the underlying cost minimization problem. In this way, we obtain new separable cost-sharing protocols in games based on arbitrary player-specific matroids, single-source connection games without delays, and connection games on $n$-series-parallel graphs with delays. All these reductions are efficiently computable - given an initial allocation profile, we obtain a cheaper profile and separable cost shares turning the profile into a pure Nash equilibrium. Hence, in these domains any approximation algorithm can be used to obtain a separable cost sharing protocol with a price of stability bounded by the approximation factor.

Includes members:
  Member "a characterization of undirected graphs admitting optimal cost shares":
    also connected through other hyperedges:
      (none)
  Member "designing networks with good equilibria under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a characterization of undirected graphs admitting optimal cost shares")
  Member "greedy algorithms for steiner forest":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the power of recourse better algorithms for facility location in online and dynamic models")
  Member "resource buying games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a characterization of undirected graphs admitting optimal cost shares")
  Member "strategic cooperation in cost sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantifying inefficiency of fair cost sharing mechanisms for sharing economy")
  Member "an o lognloglogn upper bound on the price of stability for undirected shapley network design games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a characterization of undirected graphs admitting optimal cost shares")
  Member "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "an optimal bifactor approximation algorithm for the metric uncapacitated facility location problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constant factor approximation algorithms for parity constrained facility location problems")

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)