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 "improving productive output in influencer influencee networks"):
  Abstract: In any organization, a primary goal of the designer is to maximize the net productive output. Every organization has a network (either hierarchical or other) that is used to divide the tasks. It is observed that the individuals in these networks trade off between their productive and managing efforts to do these tasks and the trade-off is caused by their positions and share of rewards in the network. Efforts of the agents here are substitutable, e.g., the increase in the productive effort by an individual in effect reduces the same of some other individual in the network, who now puts their efforts into management. The management effort of an agent improves the productivity of certain other agents in the network. In this paper, we provide a detailed analysis of the Nash equilibrium efforts of the individuals connected over a network and a design recipe of the reward sharing scheme that maximizes the net productive output. Our results show that under the strategic behavior of the agents, it may not always be possible to achieve the optimal output and we provide bounds on the achievability in such scenarios.

Includes members:
  Member "time critical social mobilization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "collaborative data acquisition")
  Member "the price of anarchy in cooperative network creation games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "geometric network creation games")

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)