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 games for transmitter cooperation in mimo multiple access channels"):
  Abstract: Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve higher throughputs in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a wireless network is of great importance in understanding cooperative behavior. This paper addresses the stability of the grand coalition of transmitters signaling over a multiple access channel using the framework of cooperative game theory. The external interference experienced by each TX is represented accurately by modeling the cooperation game between the TXs in partition form. Single user decoding and successive interference cancelling strategies are examined at the receiver. Transmitter cooperation is stable, if and only if the core of the game (the set of all divisions of grand coalition utility such that no coalition deviates) is nonempty. Determining the stability of cooperation is a co-NP-complete problem in general. For a single user decoding receiver, transmitter cooperation is shown to be stable at both high and low SNRs, while for an interference cancelling receiver with a fixed decoding order, cooperation is stable only at low SNRs and unstable at high SNR. When time sharing is allowed between decoding orders, it is shown using an approximate lower bound to the utility function that TX cooperation is also stable at high SNRs. Thus, this paper demonstrates that ideal zero cost TX cooperation over a MAC is stable and improves achievable rates for each individual user.

Includes members:
  Member "distributed learning policies for power allocation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity distributed radio access network slicing algorithms and experimental results")
  Member "the capacity of mimo channels with per antenna power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mimo capacity with average total and per antenna power constraints")
  Member "power allocation games in wireless networks of multi antenna terminals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcast channel games equilibrium characterization and a mimo mac bc game duality")
  Member "dynamic power allocation games in parallel multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost efficient throughput maximization in multi carrier cognitive radio systems")
  Member "methodologies for analyzing equilibria in wireless games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed multi user wireless charging power allocation")
  Member "coalitions in cooperative wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a mood value for fair resource allocations")
  Member "cores of cooperative games in information theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fairness in multiterminal data compression decomposition of shapley value")

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)