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 "power control in networks with heterogeneous users a quasi variational inequality approach"):
  Abstract: This paper deals with the power allocation problem in a multipoint-to-multipoint network, which is heterogenous in the sense that each transmit and receiver pair can arbitrarily choose whether to selfishly maximize its own rate or energy efficiency. This is achieved by modeling the transmit and receiver pairs as rational players that engage in a noncooperative game in which the utility function changes according to each player’s nature. The underlying game is reformulated as a quasi variational inequality (QVI) problem using convex fractional program theory. The equivalence between the QVI and the noncooperative game provides us with all the mathematical tools to study the uniqueness of its Nash equilibrium points and to derive novel algorithms that allow the network to converge to these points in an iterative manner, both with and without the need for a centralized processing. Numerical results are used to validate the proposed solutions in different operating conditions.

Includes members:
  Member "game theory for signal processing in networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "energy aware competitive power allocation for heterogeneous networks under qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reflection resource management for intelligent reflecting surface aided wireless networks")
  Member "optimal design of energy efficient multi user mimo systems is massive mimo the answer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate splitting multiple access for multi antenna downlink communication systems spectral and energy efficiency tradeoff")
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "energy efficient precoding for multiple antenna terminals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decision set optimization and energy efficient mimo communications")
  Member "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "large player games on wireless networks")
  Member "competitive design of multiuser mimo systems based on game theory a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mixed monotonic programming for fast global optimization")

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)