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 "shapley q value a local reward approach to solve global reward games"):
  Abstract: Cooperative game is a critical research area in the multi-agent reinforcement learning (MARL). Global reward game is a subclass of cooperative games, where all agents aim to maximize the global reward. Credit assignment is an important problem studied in the global reward game. Most of previous works stood by the view of non-cooperative-game theoretical framework with the shared reward approach, i.e., each agent being assigned a shared global reward directly. This, however, may give each agent an inaccurate reward on its contribution to the group, which could cause inefficient learning. To deal with this problem, we i) introduce a cooperative-game theoretical framework called extended convex game (ECG) that is a superset of global reward game, and ii) propose a local reward approach called Shapley Q-value. Shapley Q-value is able to distribute the global reward, reflecting each agent's own contribution in contrast to the shared reward approach. Moreover, we derive an MARL algorithm called Shapley Q-value deep deterministic policy gradient (SQDDPG), using Shapley Q-value as the critic for each agent. We evaluate SQDDPG on Cooperative Navigation, Prey-and-Predator and Traffic Junction, compared with the state-of-the-art algorithms, e.g., MADDPG, COMA, Independent DDPG and Independent A2C. In the experiments, SQDDPG shows a significant improvement on the convergence rate. Finally, we plot Shapley Q-value and validate the property of fair credit assignment.

Includes members:
  Member "learning to schedule communication in multi agent reinforcement learning":
    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 "tarmac targeted multi agent communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improving coordination in small scale multi agent deep reinforcement learning through memory driven communication")
  Member "actor attention critic for multi agent reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improving coordination in small scale multi agent deep reinforcement learning through memory driven communication")
  Member "learning to teach in cooperative multiagent reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning hierarchical teaching policies for cooperative agents")
  Member "fully decentralized multi agent reinforcement learning with networked agents":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cluster based social reinforcement learning")
  Member "counterfactual multi agent policy gradients":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improving coordination in small scale multi agent deep reinforcement learning through memory driven communication")
  Member "emergence of grounded compositional language in multi agent populations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improving coordination in small scale multi agent deep reinforcement learning through memory driven communication")
  Member "multi agent actor critic for mixed cooperative competitive environments":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")

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.LG(Machine Learning)