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: "efficient controller synthesis for consumption games with multiple resource types"
  Abstract: We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or omega. The omega updates model the reloading of a given resource. Each vertex belongs either to player \Box or player \Diamond, where the aim of player \Box is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, and show that although these problems are computationally hard in general, they are solvable in polynomial time for every fixed number of resource types (i.e., the dimension of the update vectors).

Connected through hyperedge HE-1 (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-2 (induced by source paper "parameterized games and parameterized automata"):
  with members:
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "the complexity of admissibility in omega regular games"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-3 (induced by source paper "limit your consumption finding bounds in average energy games"):
  with members:
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "average energy games"
    - "parametric linear dynamic logic"
    - "automated synthesis of reliable and efficient systems through game theory a case study"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "energy parity games"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-4 (induced by source paper "stochastic shortest path with energy constraints in pomdps"):
  with members:
    - "counterexample explanation by learning small strategies in markov decision processes"
    - "optimal cost almost sure reachability in pomdps"
    - "solving pomdps by searching the space of finite policies"
    - "heuristic search value iteration for pomdps"
    - "energy and mean payoff parity markov decision processes"
    - "qualitative analysis of partially observable markov decision processes"

Connected through hyperedge HE-5 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl"):
  with members:
    - "approximating optimal bounds in prompt ltl realizability in doubly exponential time"
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parameterized linear temporal logics meet costs still not costlier than ltl full version"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "parity and streett games with costs"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-6 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl full version"):
  with members:
    - "approximating optimal bounds in prompt ltl realizability in doubly exponential time"
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "parametric linear dynamic logic"
    - "parity and streett games with costs"
    - "optimal bounds in parametric ltl games"
    - "energy parity games"

Connected through hyperedge HE-7 (induced by source paper "fixed dimensional energy games are in pseudo polynomial time"):
  with members:
    - "infinite state energy games"
    - "solving parity games on integer vectors"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "hyperplane separation technique for multidimensional mean payoff games"
    - "reachability games on extended vector addition systems with states"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-8 (induced by source paper "the mso u theory of n is undecidable"):
  with members:
    - "satisfiability of ctl with constraints"
    - "weak mso with the unbounding quantifier"

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)