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: "uniform proofs of order independence for various strategy elimination procedures"
  Abstract: We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strategies. The proofs follow the same pattern and focus on the structural properties of the dominance relations. They rely on Newman's Lemma established in 1942 and related results on the abstract reduction systems.

Connected through hyperedge HE-1 (induced by source paper "a primer on strategic games"):
  with members:
    - "graphical models for game theory"
    - "regret minimizing equilibria and mechanisms for games with strict type uncertainty"
    - "conversion preference games"
    - "comparing the notions of optimality in cp nets strategic games and soft constraints"
    - "order independence and rationalizability"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-2 (induced by source paper "on iterated dominance matrix elimination and matched paths"):
  with members:
    - "discretized multinomial distributions and nash equilibria in anonymous games"
    - "computing equilibria in anonymous games"

Connected through hyperedge HE-3 (induced by source paper "direct proofs of order independence"):
  with members:
    - "order independence and rationalizability"

Connected through hyperedge HE-4 (induced by source paper "a generic approach to coalition formation"):
  with members:
    - "stable partitions in coalitional games"

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)