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 "quantitative reductions and vertex ranked infinite games"):
  Abstract: We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable properties as their qualitative counterparts and additionally retain the optimality of solutions. Moreover, we introduce vertex-ranked games as a general-purpose target for quantitative reductions and show how to solve them. In such games, the value of a play is determined only by a qualitative winning condition and a ranking of the vertices. #R##N#We provide quantitative reductions of quantitative request-response games to vertex-ranked games, thus showing ExpTime-completeness of solving the former games. Furthermore, we exhibit the usefulness and flexibility of vertex-ranked games by showing how to use such games to compute fault-resilient strategies for safety specifications. This work lays the foundation for a general study of fault-resilient strategies for more complex winning conditions

Includes members:
  Member "easy to win hard to master optimal strategies in parity games with costs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parity games with weights")
  Member "window parity games an alternative approach toward parity games with time bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "games where you can play optimally with finite memory")
  Member "average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "meet your expectations with guarantees beyond worst case synthesis in quantitative games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "games where you can play optimally with finite memory")
  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 "measuring permissiveness in parity games mean payoff parity games revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "counterexample explanation by learning small strategies in markov decision processes")
  Member "generalized mean payoff and energy games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")

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)