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: "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
  Abstract: We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for strict guarantees. On the other hand, stochastic models like Markov decision processes represent situations where the system is faced to a purely randomized environment: the aim is then to optimize the expected payoff, with no guarantee on individual outcomes. We introduce the beyond worst-case synthesis problem, which is to construct strategies that guarantee some quantitative requirement in the worst-case while providing an higher expected value against a particular stochastic model of the environment given as input. This problem is relevant to produce system controllers that provide nice expected performance in the everyday situation while ensuring a strict (but relaxed) performance threshold even in the event of very bad (while unlikely) circumstances. We study the beyond worst-case synthesis problem for two important quantitative settings: the mean-payoff and the shortest path. In both cases, we show how to decide the existence of finite-memory strategies satisfying the problem and how to synthesize one if one exists. We establish algorithms and we study complexity bounds and memory requirements.

Connected through hyperedge HE-1 (induced by source paper "games where you can play optimally with finite memory"):
  with members:
    - "concurrent games and semi random determinacy"
    - "extending finite memory determinacy by boolean combination of winning conditions"
    - "trading bounds for memory in games with counters"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "non zero sum games for reactive synthesis"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "first cycle games"

Connected through hyperedge HE-2 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes"):
  with members:
    - "expectation optimization with probabilistic guarantees in pomdps with discounted sum objectives"
    - "vulcan a monte carlo algorithm for large chance constrained mdps with risk bounding functions"
    - "variations on the stochastic shortest path problem"
    - "heuristic search value iteration for pomdps"
    - "reinforcement learning a survey"

Connected through hyperedge HE-3 (induced by source paper "life is random time is not markov decision processes with window objectives"):
  with members:
    - "multi weighted markov decision processes with reachability objectives"
    - "expected window mean payoff"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "the complexity of mean payoff games using universal graphs"
    - "extending finite memory determinacy by boolean combination of winning conditions"
    - "value iteration for long run average reward in markov decision processes"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-4 (induced by source paper "simple strategies in multi objective mdps technical report"):
  with members:
    - "multi weighted markov decision processes with reachability objectives"
    - "markov automata with multiple objectives"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "a storm is coming a modern probabilistic model checker"
    - "multi objective approaches to markov decision processes with uncertain transition parameters"
    - "variations on the stochastic shortest path problem"
    - "mixed integer quadratic programming is in np"
    - "percentile queries in multi dimensional markov decision processes"

Connected through hyperedge HE-5 (induced by source paper "multi weighted markov decision processes with reachability objectives"):
  with members:
    - "stochastic shortest paths and weight bounded properties in markov decision processes"
    - "stream differential equations specification formats and solution methods"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "knowledge spaces and the completeness of learning strategies"
    - "variations on the stochastic shortest path problem"

Connected through hyperedge HE-6 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes"):
  with members:
    - "quantile markov decision process"
    - "value iteration for long run average reward in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "trading performance for stability in markov decision processes"
    - "computing quantiles in markov reward models"

Connected through hyperedge HE-7 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes"):
  with members:
    - "mdps with energy parity objectives"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "computing quantiles in markov reward models"
    - "energy and mean payoff parity markov decision processes"
    - "energy parity games"

Connected through hyperedge HE-8 (induced by source paper "quantitative reductions and vertex ranked infinite games"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "parametric linear dynamic logic"
    - "the complexity of multi mean payoff and multi energy games"
    - "measuring permissiveness in parity games mean payoff parity games revisited"
    - "generalized mean payoff and energy games"
    - "energy parity 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.GT(Computer Science and Game Theory)