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 "fixed dimensional energy games are in pseudo polynomial time"):
  Abstract: We generalise the hyperplane separation technique Chatterjee and Velner, 2013 from multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in the number of vertices of the game graph. This answers an open question whether energy games with arbitrary initial credit can be solved in pseudo-polynomial time for fixed dimensionsi¾?3 or larger Chaloupka, 2013. It also improves the complexity of solving multi-dimensional energy games with given initial credit from non-elementary Brazdil, Janăi¾?ar, and Kuăi¾?era, 2010 to 2EXPTIME, thus establishing their 2EXPTIME-completeness.

Includes members:
  Member "infinite state energy games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy mean payoff games")
  Member "solving parity games on integer vectors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy mean payoff games")
  Member "efficient controller synthesis for consumption games with multiple resource types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy mean payoff games")
  Member "strategy synthesis for multi dimensional quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "games where you can play optimally with finite memory")
  Member "hyperplane separation technique for multidimensional mean payoff games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "reachability games on extended vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy mean payoff games")
  Member "generalized mean payoff and energy games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")

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)