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: "reactive synthesis without regret"
  Abstract: Two-player zero-sum games of infinite duration and their quantitative versions are used in verification to model the interaction between a controller (Eve) and its environment (Adam). The question usually addressed is that of the existence (and computability) of a strategy for Eve that can maximize her payoff against any strategy of Adam. In this work, we are interested in strategies of Eve that minimize her regret, i.e. strategies that minimize the difference between her actual payoff and the payoff she could have achieved if she had known the strategy of Adam in advance. We give algorithms to compute the strategies of Eve that ensure minimal regret against an adversary whose choice of strategy is (i) unrestricted, (ii) limited to positional strategies, or (iii) limited to word strategies. We also establish relations between the latter version and other problems studied in the literature.

Connected through hyperedge HE-1 (induced by source paper "the impatient may use limited optimism to minimize regret"):
  with members:
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "on delay and regret determinization of max plus automata"
    - "admissibility in quantitative graph games"
    - "non zero sum games for reactive synthesis"
    - "minimizing regret in discounted sum games"
    - "iterated regret minimization in game graphs"

Connected through hyperedge HE-2 (induced by source paper "on delay and regret determinization of max plus automata"):
  with members:
    - "comparison of max plus automata and joint spectral radius of tropical matrices"
    - "on equivalence and uniformisation problems for finite transducers"
    - "quantitative languages defined by functional automata"
    - "first cycle games"
    - "mean payoff automaton expressions"
    - "on the decomposition of k valued rational relations"

Connected through hyperedge HE-3 (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"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "variations on the stochastic shortest path problem"
    - "secure equilibria in weighted games"
    - "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-4 (induced by source paper "minimizing regret in discounted sum games"):
  with members:
    - "exact and approximate determinization of discounted sum automata"
    - "iterated regret minimization in game graphs"

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)