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: "strategic cooperation in cost sharing games"
  Abstract: In this paper we consider strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems, such as vertex and set cover, facility location, and network design problems. We concentrate on the existence and computational complexity of strong equilibria, in which no coalition can improve the cost of each of its members. Our main result reveals a connection between strong equilibrium in strategic games and the core in traditional coalitional cost sharing games studied in economics. For set cover and facility location games this results in a tight characterization of the existence of strong equilibrium using the integrality gap of suitable linear programming formulations. Furthermore, it allows to derive all existing results for strong equilibria in network design cost sharing games with arbitrary sharing via a unified approach. In addition, we are able to show that in general the strong price of anarchy is always 1. This should be contrasted with the price of anarchy of \Theta(n) for Nash equilibria. Finally, we indicate that the LP-approach can also be used to compute near-optimal and near-stable approximate strong equilibria.

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"
    - "resource buying 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 "quantifying inefficiency of fair cost sharing mechanisms for sharing economy"):
  with members:
    - "sharing non anonymous costs of multiple resources optimally"
    - "existence of stability in hedonic coalition formation games"

Connected through hyperedge HE-3 (induced by source paper "computing stable coalitions approximation algorithms for reward sharing"):
  with members:
    - "coalition games on interaction graphs a horticultural perspective"
    - "on the complexity of computing an equilibrium in combinatorial auctions"
    - "on discrete preferences and coordination"
    - "simultaneous auctions are almost efficient"
    - "cooperative games with overlapping coalitions"
    - "price of anarchy for greedy auctions"
    - "the cost of stability in coalitional games"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-4 (induced by source paper "resource buying games"):
  with members:
    - "approximate pure nash equilibria in weighted congestion games existence efficient computation and structure"

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)