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: "symmetric strategy improvement"
  Abstract: Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of classic strategy improvement to be polynomial.

Connected through hyperedge HE-1 (induced by source paper "parity games with weights"):
  with members:
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "infinite state games with finitary conditions"

Connected through hyperedge HE-2 (induced by source paper "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"):
  with members:
    - "improved algorithms for one pair and k pair streett objectives"
    - "an exponential lower bound for the latest deterministic strategy iteration algorithms"
    - "non oblivious strategy improvement"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-3 (induced by source paper "a delayed promotion policy for parity games"):
  with members:
    - "oink an implementation and evaluation of modern parity game solvers"
    - "attracting tangles to solve parity games"
    - "robust exponential worst cases for divide et impera algorithms for parity games"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "reasoning about strategies on the satisfiability problem"
    - "optimal strategy synthesis for request response games"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-4 (induced by source paper "synthesising strategy improvement and recursive algorithms for solving 2 5 player parity games"):
  with members:
    - "lazy probabilistic model checking without determinisation"
    - "non oblivious strategy improvement"
    - "gist a solver for probabilistic games"
    - "solving simple stochastic games with few random vertices"
    - "relational parametricity for computational effects"

Connected through hyperedge HE-5 (induced by source paper "improvement in small progress measures"):
  with members:
    - "strategy derivation for small progress measures"
    - "zielonka s recursive algorithm dull weak and solitaire games and tighter bounds"
    - "non oblivious strategy improvement"

Connected through hyperedge HE-6 (induced by source paper "hyper temporal networks"):
  with members:
    - "dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time dc checking"
    - "using strategy improvement to stay alive"

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)