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 "pareto region characterization for rate control in multi user systems and nash bargaining"):
  Abstract: The problem of rate control in multi-user multiple-input multiple-output (MIMO) interference systems is formulated as a multicriteria optimization (MCO) problem. The Pareto rate region of the MCO problem is characterized. It is shown that for the convexity of the Pareto rate region it is sufficient that the interference-plus-noise covariance matrices (INCMs) of multiple users with conflicting objectives approach identity matrix. The latter can be achieved by using either orthogonal signaling, time-sharing, or interference cancellation strategies. In the case of high interference, the interference cancellation is preferable in order to increase the Pareto boundary and guarantee the convexity of the Pareto rate region. The Nash bargaining (NB) is applied to transform the MCO problem into a single-objective one. The characteristics of the NB over MIMO interference systems such as the uniqueness, existence of the NB solution, and feasibility of the NB set are investigated. When the NB solution exists, the sufficient condition for the corresponding single-objective problem to have a unique solution is that the INCMs of users approach identity matrix. A simple multi-stage interference cancellation scheme, which leads to a larger convex Pareto rate region and, correspondingly, a unique NB solution with larger user rates compared to the orthogonal and time-sharing signaling schemes, is proposed. The convexity of the rate region, effectiveness of the proposed interference cancellation technique, and existence of the NB solution for MIMO interference systems are examined by means of numerical studies. The fairness of the NB solution is also demonstrated. Finally, the special cases of multi-input single-output (MISO) and single-input single-output (SISO) interference systems are also considered.

Includes members:
  Member "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large player games on wireless networks")
  Member "weighted sum rate optimization for cognitive radio mimo broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperative prediction and sensing based spectrum sharing in cognitive radio networks")
  Member "cooperative game theory and the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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.GT(Computer Science and Game Theory)