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: "stable partitions in coalitional games"
  Abstract: We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand coalition a set of different coalition arrangements for a group of defecting players. The alternatives are compared using their social welfare. We characterize the stability of a partition for a number of most natural defection functions and investigate whether and how so defined stable partitions can be reached from any initial partition by means of simple transformations. The approach is illustrated by analyzing an example in which a set of stores seeks an optimal transportation arrangement.

Connected through hyperedge HE-1 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications"):
  with members:
    - "data dissemination using instantly decodable binary codes in fog radio access networks"
    - "instantly decodable network coding for real time scalable video broadcast over wireless networks"
    - "a game theoretic framework for decentralized cooperative data exchange using network coding"
    - "a survey on device to device communication in cellular networks"
    - "delay reduction in multi hop device to device communication using network coding"
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "a game theoretic approach to minimize the completion time of network coded cooperative data exchange"
    - "what will 5g be"

Connected through hyperedge HE-2 (induced by source paper "adaptive pilot clustering in heterogeneous massive mimo networks"):
  with members:
    - "pilot clustering in asymmetric massive mimo networks"
    - "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"
    - "coalitional games in miso interference channels epsilon core and coalition structure stable set"
    - "blind pilot decontamination"
    - "massive mimo for maximal spectral efficiency how many users and pilots should be allocated"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"

Connected through hyperedge HE-3 (induced by source paper "a coalitional game for distributed inference in sensor networks with dependent observations"):
  with members:
    - "a cooperative bayesian nonparametric framework for primary user activity monitoring in cognitive radio networks"
    - "robust distributed maximum likelihood estimation with dependent quantized data"
    - "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"
    - "a generic approach to coalition formation"
    - "estimation diversity and energy efficiency in distributed sensing"

Connected through hyperedge HE-4 (induced by source paper "coalitional games in miso interference channels epsilon core and coalition structure stable set"):
  with members:
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"
    - "exchange economy in two user multiple input single output interference channels"
    - "robust monotonic optimization framework for multicell miso systems"
    - "optimal distributed beamforming for miso interference channels"
    - "coalitional game theory for communication networks a tutorial"
    - "the cost of stability in coalitional games"

Connected through hyperedge HE-5 (induced by source paper "cooperative games with overlapping coalitions"):
  with members:
    - "an anytime algorithm for optimal coalition structure generation"
    - "a generic approach to coalition formation"

Connected through hyperedge HE-6 (induced by source paper "physical layer security coalitional games for distributed cooperation"):
  with members:
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"
    - "secure communication over fading channels"
    - "a generic approach to coalition formation"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-7 (induced by source paper "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"):
  with members:
    - "a generic approach to coalition formation"

Connected through hyperedge HE-8 (induced by source paper "a distributed merge and split algorithm for fair cooperation in wireless networks"):
  with members:
    - "coalition games with cooperative transmission a cure for the curse of boundary nodes in selfish packet forwarding wireless networks"
    - "auction based distributed resource allocation for cooperation transmission in wireless networks"

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)