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 "approximate best response dynamics in random interference games"):
  Abstract: In this paper, we develop a novel approach to the convergence of best-response dynamics for the family of interference games. Interference games represent the fundamental resource allocation conflict between users of the radio spectrum. In contrast to congestion games, interference games are generally not potential games. Therefore, proving the convergence of the best-response dynamics to a Nash equilibrium in these games requires new techniques. We suggest a model for random interference games, based on the long-term fading governed by the players’ geometry. Our goal is to prove convergence of the approximate best-response dynamics with high probability with respect to the randomized game. We embrace the asynchronous model in which the acting player is chosen at each stage at random. In our approximate best-response dynamics, the action of a deviating player is chosen at random among all the approximately best ones. We show that with high probability, with respect to the players’ geometry and asymptotically with the number of players, each action increases the expected social-welfare (sum of achievable rates). Hence, the induced sum-rate process is a submartingale. Based on the martingale convergence theorem, we prove convergence of the strategy profile to an approximate Nash equilibrium with good performance for asymptotically almost all interference games. We use the Markovity of the induced sum-rate process to provide probabilistic bounds on the convergence time. Finally, we demonstrate our results in simulated examples.

Includes members:
  Member "asymptotically optimal distributed channel allocation a competitive game theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotically optimal resource block allocation with limited feedback")
  Member "distributed learning algorithms for spectrum sharing in spatial random access wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a comprehensive survey of potential game approaches to wireless networks")
  Member "dynamics in near potential games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "are multiagent systems resilient to communication failures")
  Member "on the structure of weakly acyclic games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coordination games on weighted directed graphs")
  Member "game theory and the frequency selective interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "channel equilibrium networks for learning deep representation")
  Member "on the complexity of nash dynamics and sink equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the implications of lookahead search in game playing")
  Member "cooperative game theory and the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.GT(Computer Science and Game Theory)