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: "the complexity of multi mean payoff and multi energy games"
  Abstract: In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. #R##N#We prove the finite-memory determinacy of multi-energy games and show the inter-reducibility of multimean-payoff and multi-energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete. Finally we present the first solution of multi-meanpayoff games with infinite-memory strategies. We show that multi-mean-payoff games with mean-payoff-sup objectives can be decided in NP and coNP, whereas multi-mean-payoff games with mean-payoff-inf objectives are coNP-complete.

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 "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-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 "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"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-5 (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"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "measuring permissiveness in parity games mean payoff parity games revisited"
    - "generalized mean payoff and energy games"
    - "energy parity games"

Connected through hyperedge HE-6 (induced by source paper "efficient algorithms for asymptotic bounds on termination time in vass"):
  with members:
    - "perfect half space games"
    - "complexity hierarchies beyond elementary"
    - "liveness of parameterized timed networks"
    - "demystifying reachability in vector addition systems"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "hyperplane separation technique for multidimensional mean payoff games"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-7 (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-8 (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"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "reachability games on extended vector addition systems with states"
    - "better quality in synthesis through quantitative objectives"

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)