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 "determinacy in stochastic games with unbounded payoff functions"):
  Abstract: We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded, the determinacy of such games cannot be deduced directly from Martin's determinacy result for Blackwell games. Nevertheless, we show that these games are determined both for unrestricted (i.e., history-dependent and randomized) strategies and deterministic strategies, and the equilibrium value is the same. Further, we show that these games are generally not determined for memoryless strategies. Then, we consider a subclass of Diamond-finitely-branching games and show that they are determined for all of the considered strategy types, where the equilibrium value is always the same. We also examine the existence and type of (epsilon-)optimal strategies for both players.

Includes members:
  Member "efficient controller synthesis for consumption games with multiple resource types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy mean payoff games")
  Member "approximating the termination value of one counter mdps and stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "qualitative reachability in stochastic bpa games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reachability for branching concurrent stochastic games")
  Member "reachability games on extended vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy mean payoff games")
  Member "generalized mean payoff and energy games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "one counter stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing expected runtimes for constant probability programs")
  Member "one counter markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes")
  Member "recursive concurrent stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "how good is a strategy in a game with nature")

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)