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 "approximating values of generalized reachability stochastic games"):
  Abstract: Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether player Max can win a given game with at least a given probability. A natural extension are games with a conjunction of such conditions as objective. Despite a plethora of recent results on analysis of systems with multiple objectives, decidability of this basic problem remains open. In this paper, we show the Pareto frontier of the achievable values can be approximated to a given precision. In particular, our algorithm is not limited to stopping games and can be run as an anytime algorithm, always returning the current approximation and its error bound.

Includes members:
  Member "efficient strategy iteration for mean payoff in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "monte carlo tree search for verifying reachability in markov decision processes")
  Member "decidability results for multi objective stochastic games":
    also connected through other hyperedges:
      (none)
  Member "perfect information stochastic games with generalized mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decidability results for multi objective stochastic games")
  Member "multigain a controller synthesis tool for mdps with multiple mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient strategy iteration for mean payoff in markov decision processes")
  Member "verification of markov decision processes using learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "percentile queries in multi dimensional markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "robust multidimensional mean payoff games are undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy mean payoff games")
  Member "trading performance for stability in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "life is random time is not markov decision processes with window objectives")

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)