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 "coalitional games in miso interference channels epsilon core and coalition structure stable set"):
  Abstract: The multiple-input single-output interference channel is considered. Each transmitter is assumed to know the channels between itself and all receivers perfectly and the receivers are assumed to treat interference as additive noise. In this setting, noncooperative transmission does not take into account the interference generated at other receivers which generally leads to inefficient performance of the links. To improve this situation, we study cooperation between the links using coalitional games. The players ( links) in a coalition either perform zero forcing transmission or Wiener filter precoding to each other. The epsilon-core is a solution concept for coalitional games that takes into account the overhead required in coalition deviation. We provide necessary and sufficient conditions for the strong and weak epsilon-core of our coalitional game not to be empty with zero forcing transmission. Since, the epsilon-core only considers the possibility of joint cooperation of all links, we study coalitional games in partition form in which several distinct coalitions can form. We propose a polynomial-time distributed coalition formation algorithm based on coalition merging and prove that its solution lies in the coalition structure stable set of our coalition formation game. Simulation results reveal the cooperation gains for different coalition formation complexities and deviation overhead models.

Includes members:
  Member "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shipper cooperation in stochastic drone delivery a dynamic bayesian game approach")
  Member "exchange economy in two user multiple input single output interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed channel assignment in cognitive radio networks stable matching and walrasian equilibrium")
  Member "robust monotonic optimization framework for multicell miso systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")
  Member "optimal distributed beamforming for miso interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiuser wirelessly powered backscatter communications nonlinearity waveform design and sinr energy tradeoff")
  Member "coalitional game theory for communication networks a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "the cost of stability in coalitional games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing the value of spatio temporal data in wholesale and retail data marketplaces")
  Member "stable partitions in coalitional games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")

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)