human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "games with delays a frankenstein approach"):
  Abstract: We investigate infinite games on finite graphs where the information flow is perturbed by nondeterministic signalling delays. It is known that such perturbations make synthesis problems virtually unsolvable, in the general case. On the classical model where signals are attached to states, tractable cases are rare and difficult to identify. #R##N#Here, we propose a model where signals are detached from control states, and we identify a subclass on which equilibrium outcomes can be preserved, even if signals are delivered with a delay that is finitely bounded. To offset the perturbation, our solution procedure combines responses from a collection of virtual plays following an equilibrium strategy in the instant- signalling game to synthesise, in a Frankenstein manner, an equivalent equilibrium strategy for the delayed-signalling game.

Includes members:
  Member "two player perfect information shift invariant submixing stochastic games are half positional":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perfect information stochastic games with generalized mean payoff objectives")
  Member "doomsday equilibria for omega regular games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computer aided synthesis a game theoretic approach")
  Member "robust equilibria in concurrent games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pure nash equilibria in concurrent deterministic games")
  Member "on equilibria in quantitative games with reachability safety objectives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours")
  Member "the complexity of nash equilibria in limit average games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games full version")

Question: Please tell me which class the source paper 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)