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 "leveraging statistical multi agent online planning with emergent value function approximation"):
  Abstract: Making decisions is a great challenge in distributed autonomous environments due to enormous state spaces and uncertainty. Many online planning algorithms rely on statistical sampling to avoid searching the whole state space, while still being able to make acceptable decisions. However, planning often has to be performed under strict computational constraints making online planning in multi-agent systems highly limited, which could lead to poor system performance, especially in stochastic domains. In this paper, we propose Emergent Value function Approximation for Distributed Environments (EVADE), an approach to integrate global experience into multi-agent online planning in stochastic domains to consider global effects during local planning. For this purpose, a value function is approximated online based on the emergent system behaviour by using methods of reinforcement learning. We empirically evaluated EVADE with two statistical multi-agent online planning algorithms in a highly complex and stochastic smart factory environment, where multiple agents need to process various items at a shared set of machines. Our experiments show that EVADE can effectively improve the performance of multi-agent online planning while offering efficiency w.r.t. the breadth and depth of the planning process.

Includes members:
  Member "scalable multiagent coordination with distributed online open loop planning":
    also connected through other hyperedges:
      (none)
  Member "stacked thompson bandits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "memory bounded open loop planning in large pomdps using thompson sampling")
  Member "thinking fast and slow with deep learning and tree search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "massively parallel methods for deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "fast and accurate deep network learning by exponential linear units elus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ride rewarding impact driven exploration for procedurally generated environments")
  Member "playing atari with deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "maa a heuristic search algorithm for solving decentralized pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a deep actor critic reinforcement learning framework for dynamic multichannel access")
  Member "optimal and approximate q value functions for decentralized pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep multi agent reinforcement learning for decentralized continuous cooperative control")

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.MA(Multiagent Systems)