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 "secure equilibria in weighted games"):
  Abstract: We consider two-player non zero-sum infinite duration games played on weighted graphs. We extend the notion of secure equilibrium introduced by Chatterjee et al., from the Boolean setting to this quantitative setting. As for the Boolean setting, our notion of secure equilibrium refines the classical notion of Nash equilibrium. We prove that secure equilibria always exist in a large class of weighted games which includes common measures like sup, inf, lim sup, lim inf, mean-payoff, and discounted sum. Moreover we show that one can synthesize finite-memory strategy profiles with few memory. We also prove that the constrained existence problem for secure equilibria is decidable for sup, inf, lim sup, lim inf and mean-payoff measures. Our solutions rely on new results for zero-sum quantitative games with lexicographic objectives that are interesting on their own right.

Includes members:
  Member "existence of secure equilibrium in multi player games with perfect information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computer aided synthesis a game theoretic approach")
  Member "the complexity of multi mean payoff and multi energy games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "games where you can play optimally with finite memory")
  Member "on subgame perfection in quantitative reachability games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "multiplayer cost games with simple nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")
  Member "the complexity of nash equilibria in limit average games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games full version")
  Member "better quality in synthesis through quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "imitation projected programmatic reinforcement learning")

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)