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: "computability of simple games a characterization and application to the core"
  Abstract: The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above inclusions are strict. It also extends Nakamura’s theorem about the nonemptyness of the core and shows that computable games have a finite Nakamura number, implying that the number of alternatives that the players can deal with rationally is restricted.

Connected through hyperedge HE-1 (induced by source paper "computability of simple games a complete investigation of the sixty four possibilities"):
  with members:
    - "preference aggregation theory without acyclicity the core without majority dissatisfaction"
    - "the nakamura numbers for computable simple games"

Connected through hyperedge HE-2 (induced by source paper "preference aggregation theory without acyclicity the core without majority dissatisfaction"):
  with members:
    - "the nakamura numbers for computable simple games"

Connected through hyperedge HE-3 (induced by source paper "reducibility among fractional stability problems"):
  with members:
    - "graphical models for game theory"
    - "bounded budget connection bbc games or how to make friends and influence people on a budget"
    - "settling the complexity of computing two player nash equilibria"
    - "computing nash equilibria approximation and smoothed complexity"
    - "complexity of determining nonemptiness of the core"

Connected through hyperedge HE-4 (induced by source paper "the nakamura numbers for computable simple games"):
  with members:
    - "computability of simple games a complete investigation of the sixty four possibilities"

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)