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 "equilibria of channel selection games in parallel multiple access channel"):
  Abstract: In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set of Nash equilibria (NE) of decentralized networks comprising several transmitters communicating with a single receiver that implements single user decoding. This scenario is modeled as a one-shot game where the players (the transmitters) have discrete action sets (the channels). We show that the corresponding game has always at least one NE in pure strategies, but, depending on certain parameters, the game might possess several NE. We provide an upper bound for the maximum number of NE as a function of the number of transmitters and available channels. The main contribution of this paper is a mathematical proof of the existence of a Braess-type paradox. In particular, it is shown that under the assumption of a fully loaded network, when transmitters are allowed to use all the available channels, the corresponding sum spectral efficiency achieved at the NE is lower or equal than the sum spectral efficiency achieved when transmitters can use only one channel. A formal proof of this observation is provided in the case of small networks. For general scenarios, we provide numerical examples that show that the same effect holds as long as the network is kept fully loaded. We conclude the paper by considering the case of successive interference cancellation at the receiver. In this context, we show that the power allocation vectors at the NE are capacity maximizers. Finally, simulations are presented to verify our theoretical results.

Includes members:
  Member "distributed learning policies for power allocation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity distributed radio access network slicing algorithms and experimental results")
  Member "on the nash equilibria in decentralized parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "game theoretic dynamic channel allocation for frequency selective interference channels")
  Member "shannon meets nash on the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strategic communication with side information at the decoder")
  Member "on the base station selection and base station sharing in self configuring networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a comprehensive survey of potential game approaches to wireless networks")
  Member "power allocation games for mimo multiple access channels with coordination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  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")

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.GT(Computer Science and Game Theory)