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: "computing the nucleolus of weighted voting games"
  Abstract: Weighted voting games (WVG) are coalitional games in which an agent's contribution to a coalition is given by his it weight, and a coalition wins if its total weight meets or exceeds a given quota. These games model decision-making in political bodies as well as collaboration and surplus division in multiagent domains. The computational complexity of various solution concepts for weighted voting games received a lot of attention in recent years. In particular, Elkind et al.(2007) studied the complexity of stability-related solution concepts in WVGs, namely, of the core, the least core, and the nucleolus. While they have completely characterized the algorithmic complexity of the core and the least core, for the nucleolus they have only provided an NP-hardness result. In this paper, we solve an open problem posed by Elkind et al. by showing that the nucleolus of WVGs, and, more generally, k-vector weighted voting games with fixed k, can be computed in pseudopolynomial time, i.e., there exists an algorithm that correctly computes the nucleolus and runs in time polynomial in the number of players and the maximum weight. In doing so, we propose a general framework for computing the nucleolus, which may be applicable to a wider of class of games.

Connected through hyperedge HE-1 (induced by source paper "computing stable outcomes in symmetric additively separable hedonic games"):
  with members:
    - "simple causes of complexity in hedonic games"
    - "stable partitions in additively separable hedonic games"
    - "settling the complexity of local max cut almost completely"

Connected through hyperedge HE-2 (induced by source paper "the least core and nucleolus of path cooperative games"):
  with members:
    - "path coalitional games"

Connected through hyperedge HE-3 (induced by source paper "satisfaction in societies with opinion leaders and mediators properties and an axiomatization"):
  with members:
    - "social influence as a voting system a complexity analysis of parameters and properties"

Connected through hyperedge HE-4 (induced by source paper "complementary cooperation minimal winning coalitions and power indices"):
  with members:
    - "the inverse shapley value problem"
    - "selfish bin covering"
    - "on the complexity of core kernel and bargaining set"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of core kernel and bargaining set"):
  with members:
    - "graph coalition structure generation"
    - "non transferable utility coalitional games via mixed integer linear constraints"
    - "coalitional game theory for communication networks a tutorial"
    - "the cost of stability in coalitional games"
    - "equilibria fixed points and complexity classes"

Connected through hyperedge HE-6 (induced by source paper "false name manipulations in weighted voting games"):
  with members:
    - "false name proof mechanisms for hiring a team"
    - "false name manipulations in weighted voting games splitting merging and annexation"
    - "computing voting power in easy weighted voting games"

Connected through hyperedge HE-7 (induced by source paper "non transferable utility coalitional games via mixed integer linear constraints"):
  with members:
    - "on the complexity of core kernel and bargaining set"
    - "an anytime algorithm for optimal coalition structure generation"

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)