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: "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.

Connected through hyperedge HE-1 (induced by source paper "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"):
  with members:
    - "computer aided synthesis a game theoretic approach"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "the complexity of admissibility in omega regular games"

Connected through hyperedge HE-2 (induced by source paper "computer aided synthesis a game theoretic approach"):
  with members:
    - "on the existence of weak subgame perfect equilibria"
    - "extending finite memory determinacy to multiplayer games"
    - "conditionally optimal algorithms for generalized buchi games"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"

Connected through hyperedge HE-3 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "discrete all pay bidding games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"

Connected through hyperedge HE-4 (induced by source paper "perfect half space games"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "solving parity games on integer vectors"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "reachability games on extended vector addition systems with states"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-5 (induced by source paper "on the existence of weak subgame perfect equilibria"):
  with members:
    - "computer aided synthesis a game theoretic approach"
    - "infinite subgame perfect equilibrium in the hausdorff difference hierarchy"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "infinite sequential games with real valued payoffs"
    - "existence of secure equilibrium in multi player games with perfect information"
    - "doomsday equilibria for omega regular games"

Connected through hyperedge HE-6 (induced by source paper "non zero sum games for reactive synthesis"):
  with members:
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "reactive synthesis without regret"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "variations on the stochastic shortest path problem"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"
    - "how to handle assumptions in synthesis"

Connected through hyperedge HE-7 (induced by source paper "weak subgame perfect equilibria and their application to quantitative reachability"):
  with members:
    - "multiplayer cost games with simple nash equilibria"

Connected through hyperedge HE-8 (induced by source paper "existence of secure equilibrium in multi player games with perfect information"):
  with members:
    - "assume guarantee synthesis for digital contract signing"

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