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 "energy mean payoff games"):
  Abstract: In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first player (the protagonist) is to satisfy an energy objective on the first dimension and a mean-payoff objective on the second dimension. We show that optimal strategies for the first player may require infinite memory while optimal strategies for the second player (the antagonist) do not require memory. In the one-player case (where only the first player has choices), the problem of deciding who is the winner can be solved in polynomial time while for the two-player case we show co-NP membership and we give effective constructions for the infinite-memory optimal strategies of the protagonist.

Includes members:
  Member "perfect half space games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "computer aided synthesis a game theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")
  Member "optimizing the expected mean payoff in energy markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes")
  Member "on the complexity of heterogeneous multidimensional quantitative games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "games where you can play optimally with finite memory")
  Member "fixed dimensional energy games are in pseudo polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "games where you can play optimally with finite memory")
  Member "infinite state energy games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "differentiable causal computations via delayed trace")
  Member "robust multidimensional mean payoff games are undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximating values of generalized reachability stochastic games")

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)