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 "overlapping coalition formation games for emerging communication networks"):
  Abstract: Modern cellular networks are witnessing an unprecedented evolution from classical, centralized and homogenous architectures into a mix of various technologies, in which the network devices are densely and randomly deployed in a decentralized and heterogenous architecture. This shift in network architecture requires network devices to become more autonomous and, potentially, cooperate with one another. Such cooperation can, for example, take place between interfering small access points that seek to coordinate their radio resource allocation, nearby single-antenna users that can cooperatively perform virtual MIMO communications, or even unlicensed users that wish to cooperatively sense the spectrum of the licensed users. Such cooperative mechanisms involve the simultaneous sharing and distribution of resources among a number of overlapping cooperative groups or coalitions. In this paper, a novel mathematical framework from cooperative games, dubbed \emph{overlapping coalition formation games} (OCF games), is introduced to model and solve such cooperative scenarios. First, the concepts of OCF games are presented, and then, several algorithmic aspects are studied for two main classes of OCF games. Subsequently, two example applications, namely, interference management and cooperative spectrum sensing, are discussed in detail to show how the proposed models and algorithms can be used in the future scenarios of wireless systems. Finally, we conclude by providing an overview on future directions and applications of OCF games.

Includes members:
  Member "coalitional graph games for popular content distribution in cognitive radio vanets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intelligent wireless communications enabled by cognitive radio and machine learning")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "coalitional games with overlapping coalitions for interference management in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "peer to peer energy trading with sustainable user participation a game theoretic approach")
  Member "hedonic coalition formation for distributed task allocation among wireless agents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computational complexity of hedonic games on sparse graphs")
  Member "cooperative games with overlapping coalitions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic network slicing for scalable fog computing systems with energy harvesting")
  Member "coalition formation games for distributed cooperation among roadside units in vehicular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sub channel allocation for device to device underlaying full duplex mmwave small cells using coalition formation games")
  Member "physical layer security coalitional games for distributed cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure multicast communications with private jammers")
  Member "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "location privacy in cognitive radio networks a survey")

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)