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 "games where you can play optimally with finite memory"):
  Abstract: For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as the quest for a winning strategy of the system in a game against its antagonistic environment. Depending on the specification, optimal strategies might be simple or quite complex, for example having to use (possibly infinite) memory. Hence, research strives to understand which settings allow for simple strategies. #R##N#In 2005, Gimbert and Zielonka provided a complete characterization of preference relations (a formal framework to model specifications and game objectives) that admit memoryless optimal strategies for both players. In the last fifteen years however, practical applications have driven the community toward games with complex or multiple objectives, where memory --- finite or infinite --- is almost always required. Despite much effort, the exact frontiers of the class of preference relations that admit finite-memory optimal strategies still elude us. #R##N#In this work, we establish a complete characterization of preference relations that admit optimal strategies using arena-independent finite memory, generalizing the work of Gimbert and Zielonka to the finite-memory case. We also prove an equivalent to their celebrated corollary of utmost practical interest: if both players have optimal (arena-independent-)finite-memory strategies in all one-player games, then it is also the case in all two-player games. Finally, we pinpoint the boundaries of our results with regard to the literature: our work completely covers the case of arena-independent memory (e.g., multiple parity objectives, lower- and upper-bounded energy objectives), and paves the way to the arena-dependent case (e.g., multiple lower-bounded energy objectives).

Includes members:
  Member "concurrent games and semi random determinacy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "extending finite memory determinacy by boolean combination of winning conditions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "trading bounds for memory in games with counters":
    also connected through other hyperedges:
      (none)
  Member "window parity games an alternative approach toward parity games with time bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "energy mean payoff games")
  Member "non zero sum games for reactive synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")
  Member "fixed dimensional energy games are in pseudo polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "first cycle games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "determinacy in discrete bidding infinite duration 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)