human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "power allocation games in wireless networks of multi antenna terminals"
  Abstract: We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account for the effects of transmit and receive antenna correlations is the unitary-invariant-unitary model, which is one of the most general models available in the literature. In this context, we introduce and analyze two resource allocation games. In both games, the mobile stations selfishly choose their power allocation policies in order to maximize their individual uplink transmission rates; in particular they can ignore some specified centralized policies. In the first game considered, the base station implements successive interference cancellation (SIC) and each mobile station chooses his best space-time power allocation scheme; here, a coordination mechanism is used to indicate to the users the order in which the receiver applies SIC. In the second framework, the base station is assumed to implement single-user decoding. For these two games a thorough analysis of the Nash equilibrium is provided: the existence and uniqueness issues are addressed; the corresponding power allocation policies are determined by exploiting random matrix theory; the sum-rate efficiency of the equilibrium is studied analytically in the low and high signal-to-noise ratio regimes and by simulations in more typical scenarios. Simulations show that, in particular, the sum-rate efficiency is high for the type of systems investigated and the performance loss due to the use of the proposed suboptimum coordination mechanism is very small.

Connected through hyperedge HE-1 (induced by source paper "coalitional games for transmitter cooperation in mimo multiple access channels"):
  with members:
    - "distributed learning policies for power allocation in multiple access channels"
    - "the capacity of mimo channels with per antenna power constraint"
    - "dynamic power allocation games in parallel multiple access channels"
    - "methodologies for analyzing equilibria in wireless games"
    - "coalitions in cooperative wireless networks"
    - "cores of cooperative games in information theory"

Connected through hyperedge HE-2 (induced by source paper "broadcast channel games equilibrium characterization and a mimo mac bc game duality"):
  with members:
    - "spectrum leasing as an incentive towards uplink macrocell and femtocell cooperation"
    - "a simple characterization of strategic behaviors in broadcast channels"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "distributed power allocation with rate constraints in gaussian parallel interference channels"

Connected through hyperedge HE-3 (induced by source paper "evolutionary games for multiple access control"):
  with members:
    - "prices of anarchy information and cooperation in differential games"
    - "a constrained evolutionary gaussian multiple access channel game"

Connected through hyperedge HE-4 (induced by source paper "a game theoretic model for the gaussian broadcast channel"):
  with members:
    - "a simple characterization of strategic behaviors in broadcast channels"
    - "distributed power allocation with rate constraints in gaussian parallel interference channels"
    - "the water filling game in fading multiple access channels"

Connected through hyperedge HE-5 (induced by source paper "distributed learning policies for power allocation in multiple access channels"):
  with members:
    - "dynamic power allocation games in parallel multiple access channels"
    - "methodologies for analyzing equilibria in wireless games"
    - "on the base station selection and base station sharing in self configuring networks"
    - "the mimo iterative waterfilling algorithm"
    - "competitive design of multiuser mimo systems based on game theory a unified view"
    - "correlated anarchy in overlapping wireless networks"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"
    - "energy efficient resource allocation in wireless networks"

Connected through hyperedge HE-6 (induced by source paper "adaptive resource allocation in jamming teams using game theory"):
  with members:
    - "power allocation in team jamming games in wireless ad hoc networks"
    - "introducing hierarchy in energy games"
    - "distributed power allocation with rate constraints in gaussian parallel interference channels"

Connected through hyperedge HE-7 (induced by source paper "power allocation in team jamming games in wireless ad hoc networks"):
  with members:
    - "introducing hierarchy in energy games"
    - "distributed power allocation with rate constraints in gaussian parallel interference channels"

Connected through hyperedge HE-8 (induced by source paper "dynamic power allocation games in parallel multiple access channels"):
  with members:
    - "methodologies for analyzing equilibria in wireless games"
    - "on the base station selection and base station sharing in self configuring networks"
    - "power allocation games for mimo multiple access channels with coordination"
    - "the mimo iterative waterfilling algorithm"
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"
    - "competitive design of multiuser mimo systems based on game theory a unified view"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"

Question: Please tell me which class the center node 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)