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 "low variance and zero variance baselines for extensive form games"):
  Abstract: Extensive-form games (EFGs) are a common model of multi-agent interactions with imperfect information. State-of-the-art algorithms for solving these games typically perform full walks of the game tree that can prove prohibitively slow in large games. Alternatively, sampling-based methods such as Monte Carlo Counterfactual Regret Minimization walk one or more trajectories through the tree, touching only a fraction of the nodes on each iteration, at the expense of requiring more iterations to converge due to the variance of sampled values. In this paper, we extend recent work that uses baseline estimates to reduce this variance. We introduce a framework of baseline-corrected values in EFGs that generalizes the previous work. Within our framework, we propose new baseline functions that result in significantly reduced variance compared to existing techniques. We show that one particular choice of such a function --- predictive baseline --- is provably optimal under certain sampling schemes. This allows for efficient computation of zero-variance value estimates even along sampled trajectories.

Includes members:
  Member "actor critic policy optimization in partially observable multiagent environments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning zero sum simultaneous move markov games using function approximation and correlated equilibrium")
  Member "the mirage of action dependent baselines in reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "merging deterministic policy gradient estimations with varied bias variance tradeoff for effective deep reinforcement learning")
  Member "variance reduction for policy gradient with action dependent factorized baselines":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for cyber security")
  Member "depth limited solving for imperfect information games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "single deep counterfactual regret minimization")
  Member "variance reduction in monte carlo counterfactual regret minimization vr mccfr for extensive form games using baselines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithms in multi agent systems a holistic perspective from reinforcement learning and game theory")
  Member "safe and nested subgame solving for imperfect information games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coordination in adversarial sequential team games via multi agent deep reinforcement learning")
  Member "deepstack expert level artificial intelligence in heads up no limit poker":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning zero sum simultaneous move markov games using function approximation and correlated equilibrium")
  Member "data efficient off policy policy evaluation for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the fairness of randomized trials for recommendation with heterogeneous demographics and beyond")

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)