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 allocation and pricing in multi user relay networks using stackelberg and bargaining games"):
  Abstract: This paper considers a multi-user single-relay wireless network, where the relay gets paid for helping the users forward signals, and the users pay to receive the relay service. We study the relay power allocation and pricing problems, and model the interaction between the users and the relay as a two-level Stackelberg game. In this game, the relay, modeled as the service provider and the leader of the game, sets the relay price to maximize its revenue; while the users are modeled as customers and the followers who buy power from the relay for higher transmission rates. We use a bargaining game to model the negotiation among users to achieve a fair allocation of the relay power. Based on the proposed fair relay power allocation rule, the optimal relay power price that maximizes the relay revenue is derived analytically. Simulation shows that the proposed power allocation scheme achieves higher network sum-rate and relay revenue than the even power allocation. Furthermore, compared with the sum-rate-optimal solution, simulation shows that the proposed scheme achieves better fairness with comparable network sum-rate for a wide range of network scenarios. The proposed pricing and power allocation solutions are also shown to be consistent with the laws of supply and demand.

Includes members:
  Member "interference cancellation at the relay for multi user wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "outage probability analysis of dual hop relay networks in presence of interference")
  Member "multisource transmission for wireless relay networks with linear complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi source cooperative communication with opportunistic interference cancelling relays")
  Member "network beamforming using relays with perfect channel information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting")
  Member "distributed power allocation strategies for parallel relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the performance of the relay arq networks")
  Member "relay assisted f tdma ad hoc networks node classification power allocation and relaying strategies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal distributed resource allocation for decode and forward relay networks")

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)