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 "coalitional game theory for communication networks a tutorial"):
  Abstract: Game theoretical techniques have recently become prevalent in many engineering applications, notably in communications. With the emergence of cooperation as a new communication paradigm, and the need for self-organizing, decentralized, and autonomic networks, it has become imperative to seek suitable game theoretical tools that allow to analyze and study the behavior and interactions of the nodes in future communication networks. In this context, this tutorial introduces the concepts of cooperative game theory, namely coalitional games, and their potential applications in communication and wireless networks. For this purpose, we classify coalitional games into three categories: Canonical coalitional games, coalition formation games, and coalitional graph games. This new classification represents an application-oriented approach for understanding and analyzing coalitional games. For each class of coalitional games, we present the fundamental components, introduce the key properties, mathematical techniques, and solution concepts, and describe the methodologies for applying these games in several applications drawn from the state-of-the-art research in communications. In a nutshell, this article constitutes a unified treatment of coalitional game theory tailored to the demands of communications and network engineers.

Includes members:
  Member "physical layer security coalitional games for distributed cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "location privacy in cognitive radio networks a survey")
  Member "coalitions in cooperative wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a mood value for fair resource allocations")
  Member "a distributed merge and split algorithm for fair cooperation in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online knapsack problem and budgeted truthful bipartite matching")
  Member "cores of cooperative games in information theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fairness in multiterminal data compression decomposition of shapley value")
  Member "a generic approach to coalition formation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coalitional game framework for content distribution using device to device communication")
  Member "complexity of determining nonemptiness of the core":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "it s not whom you know it s what you or your friends can do succint coalitional frameworks for network centralities")

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.IT(Information Theory)