human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal time abstract schedulers for ctmdps and markov games"
  Abstract: We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount role in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathematical point of view, however, the question of approximation is secondary compared to the fundamental question whether or not optimal control exists. #R##N#We demonstrate the existence of optimal schedulers for the time-abstract scheduler classes for all CTMDPs. Our proof is constructive: We show how to compute optimal time-abstract strategies with finite memory. It turns out that these optimal schedulers have an amazingly simple structure - they converge to an easy-to-compute memoryless scheduling policy after a finite number of steps. #R##N#Finally, we show that our argument can easily be lifted to Markov games: We show that both players have a likewise simple optimal strategy in these more general structures.

Connected through hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond"):
  with members:
    - "paws a tool for the analysis of weighted systems"
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "logical characterization of trace metrics"
    - "design and optimisation of the flyfast front end for attribute based coordination"
    - "language based abstractions for dynamical systems"
    - "limit your consumption finding bounds in average energy games"
    - "mela modelling in ecology with location attributes"
    - "logical characterization of bisimulation metrics"

Connected through hyperedge HE-2 (induced by source paper "transient reward approximation for continuous time markov chains"):
  with members:
    - "fluid model checking"
    - "finite optimal control for time bounded reachability in ctmdps and continuous time markov games"

Connected through hyperedge HE-3 (induced by source paper "finite optimal control for time bounded reachability in ctmdps and continuous time markov games"):
  with members:
    - "efficient approximation of optimal control for markov games"

Question: Please tell me which class the center node 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.FL(Formal Languages and Automata Theory)