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 "track selection in multifunction radars nash and correlated equilibria"):
  Abstract: We consider a track selection problem for multi-target tracking in a multifunction radar network from a game-theoretic perspective. The problem is formulated as a non-cooperative game. The radars are considered to be players in this game with utilities modeled using a proper tracking accuracy criterion and their strategies are the observed targets whose number is known. Initially, for the problem of coordination, the Nash equilibria are characterized and, in order to find equilibria points, a distributed algorithm based on the best-response dynamics is proposed. Afterwards, the analysis is extended to the case of partial target observability and radar connectivity and heterogeneous interests among radars. The solution concept of correlated equilibria is employed and a distributed algorithm based on the regret-matching is proposed. The proposed algorithms are shown to perform well compared to the centralized approach of significantly higher complexity.

Includes members:
  Member "track selection in multifunction radars for multi target tracking an anti coordination game":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "potential game based non myopic sensor network planning for multi target tracking")
  Member "competitive design of multiuser mimo systems based on game theory a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")

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)