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: "the complexity of solving reachability games using value and strategy iteration"
  Abstract: Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of iterations needed by both of these algorithms for providing non-trivial approximations to the value of a game with N non-terminal positions and m actions for each player in each position. In particular, both algorithms have doubly-exponential complexity. Even when the game given as input has only one non-terminal position, we prove an exponential lower bound on the worst case number of iterations needed to provide non-trivial approximations.

Connected through hyperedge HE-1 (induced by source paper "reachability for branching concurrent stochastic games"):
  with members:
    - "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes"
    - "on the problem of computing the probability of regular sets of trees"
    - "analysis of probabilistic basic parallel processes"
    - "model checking stochastic branching processes"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"
    - "qualitative reachability in stochastic bpa games"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-2 (induced by source paper "efficient strategy iteration for mean payoff in markov decision processes"):
  with members:
    - "value iteration for long run average reward in markov decision processes"
    - "efficient parallel strategy improvement for parity games"
    - "synthesising strategy improvement and recursive algorithms for solving 2 5 player parity games"
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "verification of markov decision processes using learning algorithms"
    - "parametric strategy iteration"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "using strategy improvement to stay alive"

Connected through hyperedge HE-3 (induced by source paper "strategy complexity of concurrent stochastic games with safety and reachability objectives"):
  with members:
    - "the complexity of ergodic mean payoff games"
    - "exact algorithms for solving stochastic games"
    - "solving simple stochastic games with few coin toss positions"
    - "randomness for free"

Connected through hyperedge HE-4 (induced by source paper "qualitative analysis of concurrent mean payoff games"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "the value 1 problem under finite memory strategies for concurrent mean payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "decidable problems for probabilistic automata on infinite words"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative reachability in stochastic bpa games"
    - "measuring and synthesizing systems in probabilistic environments"

Connected through hyperedge HE-5 (induced by source paper "the complexity of ergodic mean payoff games"):
  with members:
    - "exact algorithms for solving stochastic games"
    - "an exponential lower bound for the latest deterministic strategy iteration algorithms"
    - "solving simple stochastic games with few coin toss positions"
    - "exponential lower bounds for policy iteration"
    - "recursive concurrent stochastic games"
    - "stochastic limit average games are in exptime"

Connected through hyperedge HE-6 (induced by source paper "the value 1 problem under finite memory strategies for concurrent mean payoff games"):
  with members:
    - "qualitative analysis of concurrent mean payoff games"
    - "decidable problems for probabilistic automata on infinite words"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"
    - "stochastic limit average games are in exptime"

Connected through hyperedge HE-7 (induced by source paper "exact algorithms for solving stochastic games"):
  with members:
    - "the dmm bound multivariate aggregate separation bounds"
    - "bounding the radii of balls meeting every connected component of semi algebraic sets"
    - "recursive concurrent stochastic games"
    - "stochastic limit average games are in exptime"

Connected through hyperedge HE-8 (induced by source paper "strategy improvement for concurrent reachability and safety games"):
  with members:
    - "recursive concurrent stochastic games"
    - "termination criteria for solving concurrent safety and reachability games"

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)