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: "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
  Abstract: We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical analysis of the abilities of players for achieving qualitative objectives of players, i.e., reaching or maintaining game states with desired properties. We enrich concurrent game models with payoffs for the normal form games associated with the states of the model and propose a quantitative extension of the logic ATL* enabling the combination of quantitative and qualitative reasoning.

Connected through hyperedge HE-1 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours"):
  with members:
    - "strategy logic with imperfect information"
    - "admissibility in quantitative graph games"
    - "high quality synthesis against stochastic environments"
    - "assume admissible synthesis"
    - "discounting in ltl"
    - "quantified ctl expressiveness and complexity"
    - "on equilibria in quantitative games with reachability safety objectives"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-2 (induced by source paper "resource logics with a diminishing resource"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "solving parity games on integer vectors"
    - "alternating time temporal logic with finite memory strategies"
    - "model checking coalitional games in shortage resource scenarios"
    - "model checking atl under imperfect information and perfect recall semantics is undecidable"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-3 (induced by source paper "extending finite memory determinacy general techniques and an application to energy parity games"):
  with members:
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "first cycle games"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "parity and streett games with costs"
    - "multiplayer cost games with simple nash equilibria"
    - "synthesis of succinct systems"
    - "energy parity games"

Connected through hyperedge HE-4 (induced by source paper "extending finite memory determinacy to multiplayer games"):
  with members:
    - "extending finite memory determinacy general techniques and an application to energy parity games"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "parity and streett games with costs"
    - "the complexity of multi mean payoff and multi energy games"
    - "multiplayer cost games with simple nash equilibria"
    - "energy parity games"

Connected through hyperedge HE-5 (induced by source paper "technical report model checking for resource bounded atl with production and consumption of resources"):
  with members:
    - "model checking coalitional games in shortage resource scenarios"

Connected through hyperedge HE-6 (induced by source paper "model checking quantitative alternating time temporal logic on one counter game models"):
  with members:
    - "synthesis from ltl specifications with mean payoff objectives"
    - "reachability games on extended vector addition systems with states"
    - "energy parity 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)