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: "relative strength of strategy elimination procedures"
  Abstract: We compare here the relative strength of four widely used procedures on finite strategic games: iterated elimination of weakly/strictly dominated strategies by a pure/mixed strategy. A complication is that none of these procedures is based on a monotonic operator. To deal with this problem we use 'global' versions of these operators.

Connected through hyperedge HE-1 (induced by source paper "the role of monotonicity in the epistemic analysis of strategic games"):
  with members:
    - "a logical characterization of iterated admissibility"
    - "epistemic analysis of strategic games with arbitrary strategy sets"
    - "the many faces of rationalizability"

Connected through hyperedge HE-2 (induced by source paper "proof theoretic analysis of rationality for strategic games with arbitrary strategy sets"):
  with members:
    - "the many faces of rationalizability"

Connected through hyperedge HE-3 (induced by source paper "distributed iterated elimination of strictly dominated strategies"):
  with members:
    - "graphical models for game theory"
    - "the role of monotonicity in the epistemic analysis of strategic games"
    - "public announcements in strategic games with arbitrary strategy sets"
    - "common knowledge in interaction structures"
    - "comparing the notions of optimality in cp nets strategic games and soft constraints"
    - "the many faces of rationalizability"

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)