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 "worst case coalitions in routing games"):
  Abstract: Recently, there has been a growing interest in network scenarios where selfish agents are able to communicate, bargain and form coalitions, i.e., play a cooperative game, in order to overcome the inefficiency of noncooperative equilibria. We study such coalitional games under worst-case conditions in the fundamental load-balancing setting of routing over parallel links. Specifically, we investigate fundamental solution concepts of the considered cooperative game, namely the (Inner) Core and the min-max fair Nucleolus. Most notably we prove that under certain conditions they contain the system optimum.

Includes members:
  Member "coalitions in nonatomic network congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient estimation of equilibria in large aggregative games with coupling constraints")
  Member "the effect of malice on the social optimum in linear load balancing games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coalitions in routing games a worst case perspective")
  Member "coalitional game theory for communication networks a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "location privacy in cognitive radio networks a survey")

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.NI(Networking and Internet Architecture)