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 the existence of weak subgame perfect equilibria"
  Abstract: We study multi-player turn-based games played on a directed graph, where the number of players and vertices can be infinite. An outcome is assigned to every play of the game. Each player has a preference relation on the set of outcomes which allows him to compare plays. We focus on the recently introduced notion of weak subgame perfect equilibrium (weak SPE). This is a variant of the classical notion of SPE, where players who deviate can only use strategies deviating from their initial strategy in a finite number of histories. Having an SPE in a game implies having a weak SPE but the contrary is generally false. #R##N#We propose general conditions on the structure of the game graph and on the preference relations of the players that guarantee the existence of a weak SPE, that additionally is finite-memory. From this general result, we derive two large classes of games for which there always exists a weak SPE: $(i)$ the games with a finite-range outcome function, and $(ii)$ the games with a finite underlying graph and a prefix-independent outcome function. For the second class, we identify conditions on the preference relations that guarantee memoryless strategies for the weak SPE.

Connected through hyperedge HE-1 (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"
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "the complexity of admissibility in omega regular games"
    - "on subgame perfection in quantitative reachability games"
    - "multiplayer cost games with simple nash equilibria"

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

Connected through hyperedge HE-3 (induced by source paper "computer aided synthesis a game theoretic approach"):
  with members:
    - "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"
    - "secure equilibria in weighted games"

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)