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 "perfect half space games"):
  Abstract: We introduce perfect half space games, in which the goal of Player 2 is to make the sums of encountered multi-dimensional weights diverge in a direction which is consistent with a chosen sequence of perfect half spaces (chosen dynamically by Player 2). We establish that the bounding games of Jurdzi\'nski et al. (ICALP 2015) can be reduced to perfect half space games, which in turn can be translated to the lexicographic energy games of Colcombet and Niwi\'nski, and are positionally determined in a strong sense (Player 2 can play without knowing the current perfect half space). We finally show how perfect half space games and bounding games can be employed to solve multi-dimensional energy parity games in pseudo-polynomial time when both the numbers of energy dimensions and of priorities are fixed, regardless of whether the initial credit is given as part of the input or existentially quantified. This also yields an optimal 2-EXPTIME complexity with given initial credit, where the best known upper bound was non-elementary.

Includes members:
  Member "fixed dimensional energy games are in pseudo polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "games where you can play optimally with finite memory")
  Member "secure equilibria in weighted games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives")
  Member "solving parity games on integer vectors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy mean payoff games")
  Member "the complexity of multi mean payoff and multi energy games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "games where you can play optimally with finite memory")
  Member "strategy synthesis for multi dimensional quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "games where you can play optimally with finite memory")
  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 "better quality in synthesis through quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "imitation projected programmatic reinforcement learning")

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)