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: "looking at mean payoff and total payoff through windows"
  Abstract: We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP $\cap$ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.

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 "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-3 (induced by source paper "energy mean payoff games"):
  with members:
    - "perfect half space games"
    - "computer aided synthesis a game theoretic approach"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "infinite state energy games"
    - "robust multidimensional mean payoff games are undecidable"

Connected through hyperedge HE-4 (induced by source paper "expected window mean payoff"):
  with members:
    - "stability in graphs and games"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "looking at mean payoff through foggy windows"
    - "the complexity of the kth largest subset problem and related problems"
    - "trading performance for stability in markov decision processes"

Connected through hyperedge HE-5 (induced by source paper "computer aided synthesis a game theoretic approach"):
  with members:
    - "on the existence of weak subgame perfect equilibria"
    - "extending finite memory determinacy to multiplayer games"
    - "conditionally optimal algorithms for generalized buchi games"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"

Connected through hyperedge HE-6 (induced by source paper "bounding average energy games"):
  with members:
    - "undecidability of two dimensional robot games"
    - "limit your consumption finding bounds in average energy games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "reachability in succinct one counter games"
    - "reachability in two clock timed automata is pspace complete"
    - "automated synthesis of reliable and efficient systems through game theory a case study"
    - "the complexity of multi mean payoff and multi energy games"

Connected through hyperedge HE-7 (induced by source paper "window parity games an alternative approach toward parity games with time bounds"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "infinite state games with finitary conditions"
    - "automated synthesis of reliable and efficient systems through game theory a case study"
    - "parity and streett games with costs"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "the surprizing complexity of generalized reachability games"

Connected through hyperedge HE-8 (induced by source paper "non zero sum games for reactive synthesis"):
  with members:
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "reactive synthesis without regret"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "variations on the stochastic shortest path problem"
    - "secure equilibria in weighted games"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"

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)