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 "a characterization of undirected graphs admitting optimal cost shares"):
  Abstract: In a seminal paper, Chen, Roughgarden and Valiant studied cost sharing protocols for network design with the objective to implement a low-cost Steiner forest as a Nash equilibrium of an induced cost-sharing game. One of the most intriguing open problems to date is to understand the power of budget-balanced and separable cost sharing protocols in order to induce low-cost Steiner forests. In this work, we focus on undirected networks and analyze topological properties of the underlying graph so that an optimal Steiner forest can be implemented as a Nash equilibrium (by some separable cost sharing protocol) independent of the edge costs. We term a graph efficient if the above stated property holds. As our main result, we give a complete characterization of efficient undirected graphs for two-player network design games: an undirected graph is efficient if and only if it does not contain (at least) one out of few forbidden subgraphs. Our characterization implies that several graph classes are efficient: generalized series-parallel graphs, fan and wheel graphs and graphs with small cycles.

Includes members:
  Member "inefficiencies in network models a graph theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "negative prices in network pricing games")
  Member "designing networks with good equilibria under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient black box reductions for separable cost sharing")
  Member "an h n 2 upper bound on the price of stability of undirected network design games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multicast network design game on a ring")
  Member "sharing non anonymous costs of multiple resources optimally":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the price of anarchy of cost sharing in real time scheduling systems")
  Member "potential games are necessary to ensure pure nash equilibria in cost sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost sharing games for energy efficient multi hop broadcast in wireless networks")
  Member "resource buying games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient black box reductions for separable cost sharing")
  Member "an o lognloglogn upper bound on the price of stability for undirected shapley network design games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient black box reductions for separable cost sharing")

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)