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 "paradoxes in social networks with multiple products"):
  Abstract: Recently, we introduced in arXiv:1105.2434 a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives. We identify and analyze here four types of paradoxes that can arise in these networks. To this end, we use social network games that we recently introduced in arxiv:1202.2209. These paradoxes shed light on possible inefficiencies arising when one modifies the sets of products available to the agents forming a social network. One of the paradoxes corresponds to the well-known Braess paradox in congestion games and shows that by adding more choices to a node, the network may end up in a situation that is worse for everybody. We exhibit a dual version of this, where removing available choices from someone can eventually make everybody better off. The other paradoxes that we identify show that by adding or removing a product from the choice set of some node may lead to permanent instability. Finally, we also identify conditions under which some of these paradoxes cannot arise.

Includes members:
  Member "graphical models for game theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "social network games with obligatory product selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coordination games on directed graphs")
  Member "choosing products in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "social network games with obligatory product selection")
  Member "social networks with competing products":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on multi cascade influence maximization model hardness and algorithmic framework")
  Member "on the hardness of network design for bottleneck routing games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "social network games with obligatory product selection")
  Member "social network games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coordination games on weighted directed graphs")
  Member "diffusion in social networks with competing products":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coordination games on weighted directed graphs")
  Member "competitive contagion in networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximation algorithms for coordinating ad campaigns on social networks")

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)