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: "games with costs and delays"
  Abstract: We demonstrate the usefulness of adding delay to infinite games with quantitative winning conditions. In a delay game, one of the players may delay her moves to obtain a lookahead on her opponent's moves. We show that determining the winner of delay games with winning conditions given by parity automata with costs is EXPTIME-complete and that exponential bounded lookahead is both sufficient and in general necessary. Thus, although the parity condition with costs is a quantitative extension of the parity condition, our results show that adding costs does not increase the complexity of delay games with parity conditions. #R##N#Furthermore, we study a new phenomenon that appears in quantitative delay games: lookahead can be traded for the quality of winning strategies and vice versa. We determine the extent of this tradeoff. In particular, even the smallest lookahead allows to improve the quality of an optimal strategy from the worst possible value to almost the smallest possible one. Thus, the benefit of introducing lookahead is twofold: not only does it allow the delaying player to win games she would lose without, but lookahead also allows her to improve the quality of her winning strategies in games she wins even without lookahead.

Connected through hyperedge HE-1 (induced by source paper "the complexity of transducer synthesis from multi sequential specifications"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "finite state strategies in delay games"
    - "multi sequential word relations"
    - "delay games with wmso u winning conditions"

Connected through hyperedge HE-2 (induced by source paper "finite state strategies in delay games"):
  with members:
    - "finite state strategies in delay games full version"
    - "how much lookahead is needed to win infinite games"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "extending finite memory determinacy to multiplayer games"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "degrees of lookahead in regular infinite games"

Connected through hyperedge HE-3 (induced by source paper "finite state strategies in delay games full version"):
  with members:
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "finite state strategies in delay games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "extending finite memory determinacy to multiplayer games"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "weak mso with the unbounding quantifier"

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)