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: "approximability and parameterized complexity of minmax values"
  Abstract: We consider approximating the minmax value of a multi-player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of epsilon log n digits (for any constant epsilon>0 is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c >= 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show that if there are three players, k=2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated with any polynomial number of digits of accuracy in time n^(O(k)). On the other hand, we show that minmax value approximation is W[1]-hard and hence not likely to be fixed parameter tractable. Concretely, we show that if k-CLIQUE requires time n^(Omega(k)) then so does minmax value computation.

Connected through hyperedge HE-1 (induced by source paper "on the computational complexity of decision problems about multi player nash equilibria"):
  with members:
    - "on the verification and computation of strong nash equilibrium"
    - "settling some open problems on 2 player symmetric nash equilibria"

Connected through hyperedge HE-2 (induced by source paper "on the verification and computation of strong nash equilibrium"):
  with members:
    - "approximate strong equilibrium in job scheduling games"
    - "on the complexity of strong nash equilibrium hard to solve instances and smoothed complexity"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-3 (induced by source paper "computational results for extensive form adversarial team games"):
  with members:
    - "combining local search techniques and path following for bimatrix games"

Connected through hyperedge HE-4 (induced by source paper "team maxmin equilibrium efficiency bounds and algorithms"):
  with members:
    - "on the value of correlation"
    - "simple strategies for large zero sum games with applications to complexity theory"

Connected through hyperedge HE-5 (induced by source paper "multi resource defensive strategies for patrolling games with alarm systems"):
  with members:
    - "adversarial patrolling with spatially uncertain alarm signals"

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)