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: "exact algorithms for solving stochastic games"
  Abstract: Shapley’s discounted stochastic games, Everett’s recursive games and Gillette’s undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games. When the number of positions of the game is constant, our algorithms run in polynomial time.

Connected through hyperedge HE-1 (induced by source paper "acceptable strategy profiles in stochastic games"):
  with members:
    - "stochastic limit average games are in exptime"

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

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

Connected through hyperedge HE-4 (induced by source paper "upper bounds for newton s method on monotone polynomial systems and p time model checking of probabilistic one counter automata"):
  with members:
    - "polynomial time algorithms for multi type branching processes and stochastic context free grammars"
    - "efficient analysis of probabilistic programs with an unbounded counter"
    - "computing the least fixed point of positive polynomial systems"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-5 (induced by source paper "a probabilistic algorithm to compute the real dimension of a semi algebraic set"):
  with members:
    - "computing a nonnegative matrix factorization provably"
    - "bounding the radii of balls meeting every connected component of semi algebraic sets"
    - "stochastic limit average games are in exptime"

Connected through hyperedge HE-6 (induced by source paper "polynomial time algorithms for multi type branching processes and stochastic context free grammars"):
  with members:
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"

Connected through hyperedge HE-7 (induced by source paper "the complexity of solving reachability games using value and strategy iteration"):
  with members:
    - "strategy improvement for concurrent safety games"
    - "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)