human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "limit your consumption finding bounds in average energy games"):
  Abstract: Energy games are infinite two-player games played in weighted arenas with quantitative objectives that restrict the consumption of a resource modeled by the weights, e.g., a battery that is charged and drained. Typically, upper and/or lower bounds on the battery capacity are part of the problem description. Here, we consider the problem of determining upper bounds on the average accumulated energy or on the capacity while satisfying a given lower bound, i.e., we do not determine whether a given bound is sufficient to meet the specification, but if there exists a sufficient bound to meet it. #R##N#In the classical setting with positive and negative weights, we show that the problem of determining the existence of a sufficient bound on the long-run average accumulated energy can be solved in doubly-exponential time. Then, we consider recharge games: here, all weights are negative, but there are recharge edges that recharge the energy to some fixed capacity. We show that bounding the long-run average energy in such games is complete for exponential time. Then, we consider the existential version of the problem, which turns out to be solvable in polynomial time: here, we ask whether there is a recharge capacity that allows the system player to win the game. #R##N#We conclude by studying tradeoffs between the memory needed to implement strategies and the bounds they realize. We give an example showing that memory can be traded for bounds and vice versa. Also, we show that increasing the capacity allows to lower the average accumulated energy.

Includes members:
  Member "parameterized linear temporal logics meet costs still not costlier than ltl":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free")
  Member "average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "games where you can play optimally with finite memory")
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "automated synthesis of reliable and efficient systems through game theory a case study":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "games where you can play optimally with finite memory")
  Member "efficient controller synthesis for consumption games with multiple resource types":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy mean payoff games")
  Member "the complexity of multi mean payoff and multi energy games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "games where you can play optimally with finite memory")
  Member "strategy synthesis for multi dimensional quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "games where you can play optimally with finite memory")
  Member "energy parity games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "games where you can play optimally with finite memory")

Question: Please tell me which class the source paper 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)