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: "the complexity of admissibility in omega regular games"
  Abstract: Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possible outcomes of such strategies.

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"
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "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"
    - "on the existence of weak subgame perfect equilibria"
    - "admissibility in quantitative graph 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 "parameterized games and parameterized automata"):
  with members:
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-4 (induced by source paper "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"):
  with members:
    - "computer aided synthesis a game theoretic approach"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "secure equilibria in weighted games"

Connected through hyperedge HE-5 (induced by source paper "admissibility in concurrent games"):
  with members:
    - "assume admissible synthesis"

Connected through hyperedge HE-6 (induced by source paper "on the existence of weak subgame perfect equilibria"):
  with members:
    - "computer aided synthesis a game theoretic approach"
    - "infinite subgame perfect equilibrium in the hausdorff difference hierarchy"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "non zero sum games for reactive synthesis"
    - "secure equilibria in weighted games"
    - "infinite sequential games with real valued payoffs"
    - "existence of secure equilibrium in multi player games with perfect information"

Connected through hyperedge HE-7 (induced by source paper "optimal assumptions for synthesis"):
  with members:
    - "assume admissible synthesis"
    - "how to handle assumptions in synthesis"
    - "environment assumptions for synthesis"

Connected through hyperedge HE-8 (induced by source paper "non zero sum games for reactive synthesis"):
  with members:
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "assume admissible synthesis"
    - "reactive synthesis without regret"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "variations on the stochastic shortest path problem"
    - "secure equilibria in weighted games"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"

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)