human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "preference aggregation theory without acyclicity the core without majority dissatisfaction"):
  Abstract: Acyclicity of individual preferences is a minimal assumption in social choice theory. We replace that assumption by the direct assumption that preferences have maximal elements on a fixed agenda. We show that the core of a simple game is nonempty for all profiles of such preferences if and only if the number of alternatives in the agenda is less than the Nakamura number of the game. The same is true if we replace the core by the core without majority dissatisfaction, obtained by deleting from the agenda all the alternatives that are non-maximal for all players in a winning coalition. Unlike the core, the core without majority dissatisfaction depends only on the players’ sets of maximal elements and is included in the union of such sets. A result for an extended framework gives another sense in which the core without majority dissatisfaction behaves better than the core.

Includes members:
  Member "computability of simple games a characterization and application to the core":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computability of simple games a complete investigation of the sixty four possibilities")
  Member "the nakamura numbers for computable simple games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computability of simple games a complete investigation of the sixty four possibilities")

Question: Please tell me which class the source paper 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)