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 "cooperative resource allocation games under spectral mask and total power constraints"):
  Abstract: Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division multiplexing and frequency division multiplexing (TDM/FDM) scheme as a manner of cooperation in the NB resource allocation game with only spectrum mask constraints (SMCs), it is shown that the efficiency of the corresponding solution depends on both the interference-to-signal and interference-to-noise ratios of the users. Sufficient conditions under which the joint TDM/FDM based NB solution outperforms a noncooperative Nash equilibrium solution are derived and shown to be mild. A semi-distributed algorithm is proposed for finding the NB solution of the corresponding game with SMCs only. The NB based resource allocation game with both SMCs and total power constraints (TPCs) is shown to be a nonconvex optimization problem of high complexity. For such a game, a classification of two-user systems into bandwidth- and power-dominant systems is proposed based on the concept of Pareto-optimality. This classification gives insights to the resource allocation problem by showing that the benefits of both users are guaranteed to increase simultaneously only when the dominant resource in the system increases. Using this classification, efficient suboptimal algorithms of low complexity are derived based on the idea of optimally allocating the dominant resource and suboptimally allocating the other resource. Simulation results demonstrate the efficiency of the proposed cooperative NB resource allocation strategies.

Includes members:
  Member "power allocation games for mimo multiple access channels with coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "large player games on wireless networks")
  Member "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mixed monotonic programming for fast global optimization")
  Member "energy efficient resource allocation in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "cooperative game theory and the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed learning for channel allocation over a shared spectrum")
  Member "bargaining over the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep multi user reinforcement learning for distributed dynamic spectrum access")

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)