human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "resource buying games"
  Abstract: In resource buying games a set of players jointly buys a subset of a finite resource set E (e.g., machines, edges, or nodes in a digraph). The cost of a resource e depends on the number (or load) of players using e, and has to be paid completely by the players before it becomes available. Each player i needs at least one set of a predefined family S_i in 2^E to be available. Thus, resource buying games can be seen as a variant of congestion games in which the load-dependent costs of the resources can be shared arbitrarily among the players. A strategy of player i in resource buying games is a tuple consisting of one of i's desired configurations S_i together with a payment vector p_i in R^E_+ indicating how much i is willing to contribute towards the purchase of the chosen resources. In this paper, we study the existence and computational complexity of pure Nash equilibria (PNE, for short) of resource buying games. In contrast to classical congestion games for which equilibria are guaranteed to exist, the existence of equilibria in resource buying games strongly depends on the underlying structure of the S_i's and the behavior of the cost functions. We show that for marginally non-increasing cost functions, matroids are exactly the right structure to consider, and that resource buying games with marginally non-decreasing cost functions always admit a PNE.

Connected through hyperedge HE-1 (induced by source paper "efficient black box reductions for separable cost sharing"):
  with members:
    - "a characterization of undirected graphs admitting optimal cost shares"
    - "designing networks with good equilibria under uncertainty"
    - "greedy algorithms for steiner forest"
    - "strategic cooperation in cost sharing games"
    - "an o lognloglogn upper bound on the price of stability for undirected shapley network design games"
    - "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth"
    - "an optimal bifactor approximation algorithm for the metric uncapacitated facility location problem"

Connected through hyperedge HE-2 (induced by source paper "a characterization of undirected graphs admitting optimal cost shares"):
  with members:
    - "inefficiencies in network models a graph theoretic perspective"
    - "designing networks with good equilibria under uncertainty"
    - "an h n 2 upper bound on the price of stability of undirected network design games"
    - "sharing non anonymous costs of multiple resources optimally"
    - "potential games are necessary to ensure pure nash equilibria in cost sharing games"
    - "an o lognloglogn upper bound on the price of stability for undirected shapley network design games"

Connected through hyperedge HE-3 (induced by source paper "uniqueness of equilibria in atomic splittable polymatroid congestion games"):
  with members:
    - "matroids are immune to braess paradox"
    - "resource competition on integral polymatroids"
    - "the uniqueness property for networks with several origin destination pairs"

Connected through hyperedge HE-4 (induced by source paper "matroids are immune to braess paradox"):
  with members:
    - "inefficiencies in network models a graph theoretic perspective"
    - "resource competition on integral polymatroids"

Connected through hyperedge HE-5 (induced by source paper "lp based covering games with low price of anarchy"):
  with members:
    - "near optimality in covering and packing games by exposing global information"
    - "an analysis of the skype peer to peer internet telephony protocol"
    - "a primal dual parallel approximation technique applied to weighted set and vertex covers"

Question: Please tell me which class the center node 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)