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 "alternating offer bargaining games over the gaussian interference channel"):
  Abstract: This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users to cooperate using a simple version of Han-Kobayashi scheme was studied and the Nash bargaining solution (NBS) was used to obtain a fair operating point. Here a noncooperative bargaining game of alternating offers is adopted to model the bargaining process and rates resulting from the equilibrium outcome are analyzed. In particular, it is shown that the operating point resulting from the formulated bargaining game depends on the cost of delay in bargaining and how bargaining proceeds. If the associated bargaining problem is regular, a unique perfect equilibrium exists and lies on the individual rational efficient frontier of the achievable rate region. Besides, the equilibrium outcome approaches the NBS if the bargaining costs of both users are negligible.

Includes members:
  Member "a game theoretic view of the interference channel impact of coordination and bargaining":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach")
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "coordination and bargaining over the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improper signaling on the two user siso interference channel")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cooperative game theory and the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed learning for channel allocation over a shared spectrum")

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)