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: "on subgame perfection in quantitative reachability games"
  Abstract: We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria in the multiplayer case remained and is still an open problem. In this paper, we focus our study on the concept of subgame perfect equilibrium, a refinement of Nash equilibrium well-suited in the framework of games played on graphs. We also introduce the new concept of subgame perfect secure equilibrium. We prove the existence of subgame perfect equilibria (resp. subgame perfect secure equilibria) in multiplayer (resp. two-player) quantitative reachability games. Moreover, we provide an algorithm deciding the existence of secure equilibria in the multiplayer case.

Connected through hyperedge HE-1 (induced by source paper "determinacy in discrete bidding infinite duration games"):
  with members:
    - "all pay bidding games on graphs"
    - "concurrent games and semi random determinacy"
    - "infinite duration poorman bidding games"
    - "quantitative analysis of smart contracts"
    - "infinite duration bidding games"
    - "discrete all pay bidding games"
    - "first cycle games"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-2 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games"):
  with members:
    - "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"
    - "computer aided synthesis a game theoretic approach"
    - "on the existence of weak subgame perfect equilibria"
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "the complexity of admissibility in omega regular games"
    - "multiplayer cost games with simple nash equilibria"

Connected through hyperedge HE-3 (induced by source paper "on relevant equilibria in reachability games"):
  with members:
    - "the complexity of subgame perfect equilibria in quantitative reachability games"
    - "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"
    - "computer aided synthesis a game theoretic approach"
    - "multiplayer cost games with simple nash equilibria"
    - "complexity results about nash equilibria"

Connected through hyperedge HE-4 (induced by source paper "infinite duration poorman bidding games"):
  with members:
    - "the efficiency of best response dynamics"
    - "all pay bidding games on graphs"
    - "determinacy in discrete bidding infinite duration games"
    - "quantitative analysis of smart contracts"
    - "infinite duration bidding games"
    - "bidding games and efficient allocations"
    - "optimizing scrip systems crashes altruists hoarders sybils and collusion"
    - "sequential auctions of identical items with budget constrained bidders"

Connected through hyperedge HE-5 (induced by source paper "timed network games with clocks"):
  with members:
    - "mean payoff games on timed automata"
    - "adding negative prices to priced timed games"
    - "reachability in two clock timed automata is pspace complete"
    - "timed parity games complexity and robustness"

Connected through hyperedge HE-6 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "discrete all pay bidding games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"

Connected through hyperedge HE-7 (induced by source paper "infinite subgame perfect equilibrium in the hausdorff difference hierarchy"):
  with members:
    - "coalgebraic analysis of subgame perfect equilibria in infinite games without discounting"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"

Connected through hyperedge HE-8 (induced by source paper "secure equilibria in weighted games"):
  with members:
    - "existence of secure equilibrium in multi player games with perfect information"
    - "the complexity of multi mean payoff and multi energy games"
    - "multiplayer cost games with simple nash equilibria"
    - "the complexity of nash equilibria in limit average games"
    - "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)