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 "algorithms for stochastic games on interference channels"):
  Abstract: We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game. We provide sufficient conditions for existence and uniqueness of a Nash equilibrium (NE). We then formulate the problem of finding NE as a variational inequality (VI) problem and present an algorithm to solve the VI using regularization. We also provide distributed algorithms to compute Pareto optimal solutions for the proposed game.

Includes members:
  Member "learning equilibrium play for stochastic parallel gaussian interference channels":
    also connected through other hyperedges:
      (none)
  Member "on the nash equilibria in decentralized parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "game theoretic dynamic channel allocation for frequency selective interference channels")
  Member "the mimo iterative waterfilling algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "distributed power allocation with rate constraints in gaussian parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "game theoretic dynamic channel allocation for frequency selective interference channels")
  Member "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)