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: "admissibility in quantitative graph games"
  Abstract: Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the no- tion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to design algorithms to decide relevant verification and synthesis problems.

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"
    - "on the existence of weak subgame perfect equilibria"
    - "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 "reasoning about quality and fuzziness of strategic behaviours"):
  with members:
    - "strategy logic with imperfect information"
    - "high quality synthesis against stochastic environments"
    - "assume admissible synthesis"
    - "discounting in ltl"
    - "quantified ctl expressiveness and complexity"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "on equilibria in quantitative games with reachability safety objectives"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-3 (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"
    - "on the existence of weak subgame perfect equilibria"
    - "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-4 (induced by source paper "the impatient may use limited optimism to minimize regret"):
  with members:
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "on delay and regret determinization of max plus automata"
    - "reactive synthesis without regret"
    - "non zero sum games for reactive synthesis"
    - "minimizing regret in discounted sum games"
    - "iterated regret minimization in game graphs"

Connected through hyperedge HE-5 (induced by source paper "parameterized games and parameterized automata"):
  with members:
    - "assume admissible synthesis"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "the complexity of admissibility in omega regular games"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "generalized mean payoff and energy 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.LO(Logic in Computer Science)