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: "strategy synthesis for multi dimensional quantitative objectives"
  Abstract: Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express $\omega$-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.

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 "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-3 (induced by source paper "reachability games with relaxed energy constraints"):
  with members:
    - "bounding average energy games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "reachability in succinct one counter games"
    - "on the complexity of counter reachability games"
    - "reachability in two clock timed automata is pspace complete"
    - "the complexity of multi mean payoff and multi energy games"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-4 (induced by source paper "non deterministic weighted automata evaluated over markov chains"):
  with members:
    - "convex language semantics for nondeterministic probabilistic automata"
    - "quantitative automata under probabilistic semantics"
    - "percentile queries in multi dimensional markov decision processes"

Connected through hyperedge HE-5 (induced by source paper "playing with repetitions in data words using energy games"):
  with members:
    - "perfect half space games"
    - "reasoning about data repetitions with counter systems"
    - "solving parity games on integer vectors"
    - "reachability games on extended vector addition systems with states"
    - "temporal logics on words with multiple data values"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-6 (induced by source paper "perfect half space games"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "secure equilibria in weighted games"
    - "solving parity games on integer vectors"
    - "the complexity of multi mean payoff and multi energy games"
    - "reachability games on extended vector addition systems with states"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "optimizing the expected mean payoff in energy markov decision processes"):
  with members:
    - "an omega algebra for real time energy problems"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "average energy games"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "zero reachability in probabilistic multi counter automata"
    - "the odds of staying on budget"
    - "polynomial time algorithms for energy games with special weight structures"

Connected through hyperedge HE-8 (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"
    - "looking at mean payoff and total payoff through windows"
    - "automated synthesis of reliable and efficient systems through game theory a case study"

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)