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: "approximating the termination value of one counter mdps and stochastic games"
  Abstract: One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems ("is the optimal termination value = 1?") for OC-MDPs (and OC-SSGs) and showed them to be decidable in P-time (in NP and coNP, respectively). However, quantitative decision and approximation problems ("is the optimal termination value ? p", or "approximate the termination value within epsilon") are far more challenging. This is so in part because optimal strategies may not exist, and because even when they do exist they can have a highly non-trivial structure. It thus remained open even whether any of these quantitative termination problems are computable. In this paper we show that all quantitative approximation problems for the termination value for OC-MDPs and OC-SSGs are computable. Specifically, given a OC-SSG, and given epsilon > 0, we can compute a value v that approximates the value of the OC-SSG termination game within additive error epsilon, and furthermore we can compute epsilon-optimal strategies for both players in the game. A key ingredient in our proofs is a subtle martingale, derived from solving certain LPs that we can associate with a maximizing OC-MDP. An application of Azuma's inequality on these martingales yields a computable bound for the "wealth" at which a "rich person's strategy" becomes epsilon-optimal for OC-MDPs.

Connected through hyperedge HE-1 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "perfect half space games"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"
    - "complexity hierarchies beyond elementary"

Connected through hyperedge HE-2 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "discrete all pay bidding games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"

Connected through hyperedge HE-3 (induced by source paper "stochastic invariants for probabilistic termination"):
  with members:
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "proving termination of probabilistic programs using patterns"
    - "reinforcement learning a survey"

Connected through hyperedge HE-4 (induced by source paper "zero reachability in probabilistic multi counter automata"):
  with members:
    - "stochastic parity games on lossy channel systems"
    - "model checking vector addition systems with one zero test"
    - "polynomial time algorithms for multi type branching processes and stochastic context free grammars"
    - "efficient analysis of probabilistic programs with an unbounded counter"
    - "reachability games on extended vector addition systems with states"
    - "one counter stochastic games"
    - "one counter markov decision processes"
    - "decisive markov chains"

Connected through hyperedge HE-5 (induced by source paper "the odds of staying on budget"):
  with members:
    - "the complexity of the kth largest subset problem and related problems"
    - "variations on the stochastic shortest path problem"
    - "percentile queries in multi dimensional markov decision processes"
    - "computing quantiles in markov reward models"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "one counter markov decision processes"

Connected through hyperedge HE-6 (induced by source paper "solving stochastic b uchi games on infinite arenas with a finite attractor"):
  with members:
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "determinacy in stochastic games with unbounded payoff functions"
    - "qualitative reachability in stochastic bpa games"
    - "multiply recursive upper bounds with higman s lemma"
    - "one counter stochastic games"
    - "recursive concurrent stochastic games"
    - "on termination for faulty channel machines"
    - "verifying nondeterministic probabilistic channel systems against ω regular linear time properties"

Connected through hyperedge HE-7 (induced by source paper "determinacy in stochastic games with unbounded payoff functions"):
  with members:
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "qualitative reachability in stochastic bpa games"
    - "reachability games on extended vector addition systems with states"
    - "generalized mean payoff and energy games"
    - "one counter stochastic games"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"
    - "on computing fixpoints in well structured regular model checking with applications to lossy channel systems"

Connected through hyperedge HE-8 (induced by source paper "minimizing expected termination time in one counter markov decision processes"):
  with members:
    - "qualitative reachability in stochastic bpa games"
    - "efficient analysis of probabilistic programs with an unbounded counter"
    - "generalized mean payoff and energy games"
    - "one counter stochastic games"
    - "energy parity games"
    - "one counter markov decision processes"
    - "branching time model checking of one counter processes"

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.GT(Computer Science and Game Theory)