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: "social network games"
  Abstract: One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes influenced by their neighbours can adopt one out of several alternatives. To analyze the consequences of such product adoption we associate here with each such social network a natural strategic game between the agents. #R##N#In these games the payoff of each player weakly increases when more players choose his strategy, which is exactly opposite to the congestion games. The possibility of not choosing any product results in two special types of (pure) Nash equilibria. #R##N#We show that such games may have no Nash equilibrium and that determining an existence of a Nash equilibrium, also of a special type, is NP-complete. This implies the same result for a more general class of games, namely polymatrix games. The situation changes when the underlying graph of the social network is a DAG, a simple cycle, or, more generally, has no source nodes. For these three classes we determine the complexity of an existence of (a special type of) Nash equilibria. #R##N#We also clarify for these categories of games the status and the complexity of the finite best response property (FBRP) and the finite improvement property (FIP). Further, we introduce a new property of the uniform FIP which is satisfied when the underlying graph is a simple cycle, but determining it is co-NP-hard in the general case and also when the underlying graph has no source nodes. The latter complexity results also hold for the property of being a weakly acyclic game. A preliminary version of this paper appeared as [19].

Connected through hyperedge HE-1 (induced by source paper "coordination games on weighted directed graphs"):
  with members:
    - "self stabilization through the lens of game theory"
    - "efficient local search in coordination games on graphs"
    - "coordination games on directed graphs"
    - "efficient equilibria in polymatrix coordination games"
    - "existence of stability in hedonic coalition formation games"
    - "a classification of weakly acyclic games"
    - "on dynamics in selfish network creation"
    - "diffusion in social networks with competing products"

Connected through hyperedge HE-2 (induced by source paper "coordination games on directed graphs"):
  with members:
    - "a faster tableau for ctl"
    - "a faster tableau for ctl"
    - "graphical models for game theory"
    - "social network games with obligatory product selection"
    - "diffusion in social networks with competing products"

Connected through hyperedge HE-3 (induced by source paper "a network based rating system and its resistance to bribery"):
  with members:
    - "social networks with competing products"
    - "how hard is bribery in elections"

Connected through hyperedge HE-4 (induced by source paper "paradoxical examples of social networks games with product choice"):
  with members:
    - "paradoxes in social networks with multiple products"

Connected through hyperedge HE-5 (induced by source paper "coordination games on graphs"):
  with members:
    - "social network games with obligatory product selection"
    - "existence of stability in hedonic coalition formation games"
    - "diffusion in social networks with competing products"
    - "stable partitions in additively separable hedonic games"
    - "optimal partitions in additively separable hedonic games"

Connected through hyperedge HE-6 (induced by source paper "paradoxes in social networks with multiple products"):
  with members:
    - "graphical models for game theory"
    - "social network games with obligatory product selection"
    - "choosing products in social networks"
    - "social networks with competing products"
    - "on the hardness of network design for bottleneck routing games"
    - "diffusion in social networks with competing products"
    - "competitive contagion in networks"

Connected through hyperedge HE-7 (induced by source paper "social network games with obligatory product selection"):
  with members:
    - "graphical models for game theory"
    - "paradoxes in social networks with multiple products"
    - "choosing products in social networks"
    - "on the hardness of network design for bottleneck routing games"
    - "diffusion in social networks with competing products"

Connected through hyperedge HE-8 (induced by source paper "social networks with competing products"):
  with members:
    - "paradoxes in social networks with multiple products"
    - "choosing products in social networks"
    - "diffusion in social networks with competing products"
    - "competitive contagion in networks"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"

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)