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 "learning to collaborate multi scenario ranking via multi agent reinforcement learning"):
  Abstract: Ranking is a fundamental and widely studied problem in scenarios such as search, advertising, and recommendation. However, joint optimization for multi-scenario ranking, which aims to improve the overall performance of several ranking strategies in different scenarios, is rather untouched. Separately optimizing each individual strategy has two limitations. The first one is lack of collaboration between scenarios meaning that each strategy maximizes its own objective but ignores the goals of other strategies, leading to a sub-optimal overall performance. The second limitation is the inability of modeling the correlation between scenarios meaning that independent optimization in one scenario only uses its own user data but ignores the context in other scenarios. #R##N#In this paper, we formulate multi-scenario ranking as a fully cooperative, partially observable, multi-agent sequential decision problem. We propose a novel model named Multi-Agent Recurrent Deterministic Policy Gradient (MA-RDPG) which has a communication component for passing messages, several private actors (agents) for making actions for ranking, and a centralized critic for evaluating the overall performance of the co-working actors. Each scenario is treated as an agent (actor). Agents collaborate with each other by sharing a global action-value function (the critic) and passing messages that encodes historical information across scenarios. The model is evaluated with online settings on a large E-commerce platform. Results show that the proposed model exhibits significant improvements against baselines in terms of the overall performance.

Includes members:
  Member "counterfactual multi agent policy gradients":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improving coordination in small scale multi agent deep reinforcement learning through memory driven communication")
  Member "value decomposition networks for cooperative multi agent learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scaling up multiagent reinforcement learning for robotic systems learn an adaptive sparse communication graph")
  Member "on application of learning to rank for e commerce search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "handling position bias for unbiased learning to rank in hotels search")
  Member "learning to communicate with deep multi agent reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "continuous control with deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "learning continuous control policies by stochastic value gradients":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to fly via deep model based reinforcement learning")
  Member "deep recurrent q learning for partially observable mdps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "unbiased offline evaluation of contextual bandit based news article recommendation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "self supervised contextual bandits in computer vision")

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.AI(Artificial Intelligence)