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: "sharing non anonymous costs of multiple resources optimally"
  Abstract: In cost sharing games, the existence and efficiency of pure Nash equilibria fundamentally depends on the method that is used to share the resources' costs. We consider a general class of resource allocation problems in which a set of resources is used by a heterogeneous set of selfish users. The cost of a resource is a (non-decreasing) function of the set of its users. Under the assumption that the costs of the resources are shared by uniform cost sharing protocols, i.e., protocols that use only local information of the resource's cost structure and its users to determine the cost shares, we exactly quantify the inefficiency of the resulting pure Nash equilibria. Specifically, we show tight bounds on prices of stability and anarchy for games with only submodular and only supermodular cost functions, respectively, and an asymptotically tight bound for games with arbitrary set-functions. While all our upper bounds are attained for the well-known Shapley cost sharing protocol, our lower bounds hold for arbitrary uniform cost sharing protocols and are even valid for games with anonymous costs, i.e., games in which the cost of each resource only depends on the cardinality of the set of its users.

Connected through hyperedge HE-1 (induced by source paper "on the price of anarchy of cost sharing in real time scheduling systems"):
  with members:
    - "potential games are necessary to ensure pure nash equilibria in cost sharing games"
    - "a model for minimizing active processor time"
    - "efficient coordination mechanisms for unrelated machine scheduling"

Connected through hyperedge HE-2 (induced by source paper "quantifying inefficiency of fair cost sharing mechanisms for sharing economy"):
  with members:
    - "existence of stability in hedonic coalition formation games"
    - "strategic cooperation in cost sharing games"

Connected through hyperedge HE-3 (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"
    - "potential games are necessary to ensure pure nash equilibria in cost sharing games"
    - "resource buying games"
    - "an o lognloglogn upper bound on the price of stability for undirected shapley network design games"

Connected through hyperedge HE-4 (induced by source paper "computing approximate pure nash equilibria in shapley value weighted congestion games"):
  with members:
    - "potential games are necessary to ensure pure nash equilibria in cost sharing games"
    - "shapley meets shapley"
    - "efficient computation of approximate pure nash equilibria in congestion games"
    - "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)