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: "group activity selection problem"
  Abstract: We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model, where agents' preferences are binary, i.e., each agent classifies all pairs of the form "(activity, group size)" into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents' preferences satisfy certain natural constraints.

Connected through hyperedge HE-1 (induced by source paper "robustness against agent failure in hedonic games"):
  with members:
    - "group activity selection on social networks"
    - "hedonic games with graph restricted communication"
    - "learning cooperative games"
    - "solving cooperative reliability games"

Connected through hyperedge HE-2 (induced by source paper "anonymous hedonic game for task allocation in a large scale multiple agent system"):
  with members:
    - "existence of stability in hedonic coalition formation games"
    - "hedonic coalition formation for distributed task allocation among wireless agents"

Connected through hyperedge HE-3 (induced by source paper "group activity selection on social networks"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "on parameterized complexity of group activity selection problems on social networks"
    - "fair division of a graph"
    - "hedonic games with graph restricted communication"
    - "complexity results for rainbow matchings"
    - "core stability in hedonic coalition formation"

Connected through hyperedge HE-4 (induced by source paper "on parameterized complexity of group activity selection problems on social networks"):
  with members:
    - "group activity selection on social networks"
    - "hedonic games with graph restricted communication"

Connected through hyperedge HE-5 (induced by source paper "mostly sunny a forecast of tomorrow s power index research"):
  with members:
    - "the prediction value"
    - "the inverse problem for power distributions in committees"
    - "the inverse shapley value problem"

Connected through hyperedge HE-6 (induced by source paper "approximate equilibrium and incentivizing social coordination"):
  with members:
    - "approximate strong equilibrium in job scheduling games"
    - "strong price of anarchy and coalitional dynamics"
    - "assignment games with conflicts price of total anarchy and convergence results via semi smoothness"
    - "on discrete preferences and coordination"
    - "combinatorial auctions with restricted complements"
    - "stable partitions in additively separable hedonic games"
    - "dynamics of profit sharing games"
    - "strong nash equilibria in games with the lexicographical improvement property"

Connected through hyperedge HE-7 (induced by source paper "achieving fully proportional representation approximability results"):
  with members:
    - "approximating the maxcover problem with bounded frequencies in fpt time"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "multimode control attacks on elections"
    - "where are the hard manipulation problems"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-8 (induced by source paper "fully proportional representation as resource allocation approximability results"):
  with members:
    - "on the computation of fully proportional representation"
    - "multimode control attacks on elections"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

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)