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 "equilibrium computation and robust optimization in zero sum games with submodular structure"):
  Abstract: We define a class of zero-sum games with combinatorial structure, where the best response problem of one player is to maximize a submodular function. For example, this class includes security games played on networks, as well as the problem of robustly optimizing a submodular function over the worst case from a set of scenarios. The challenge in computing equilibria is that both players' strategy spaces can be exponentially large. Accordingly, previous algorithms have worst-case exponential runtime and indeed fail to scale up on practical instances. We provide a pseudopolynomial-time algorithm which obtains a guaranteed $(1 - 1/e)^2$-approximate mixed strategy for the maximizing player. Our algorithm only requires access to a weakened version of a best response oracle for the minimizing player which runs in polynomial time. Experimental results for network security games and a robust budget allocation problem confirm that our algorithm delivers near-optimal solutions and scales to much larger instances than was previously possible.

Includes members:
  Member "robust optimization for non convex objectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distribution agnostic model agnostic meta learning")
  Member "robust budget allocation via continuous submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "algorithmic persuasion with no externalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "public bayesian persuasion being almost optimal and almost persuasive")
  Member "a reduction for optimizing lattice submodular functions with diminishing returns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "majorisation minimisation algorithms for minimising the difference between lattice submodular functions")
  Member "the mysteries of security games equilibrium computation becomes combinatorial algorithm design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ai for social impact learning and planning in the data to deployment pipeline")
  Member "correlation robust stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simple mechanisms for non linear agents")

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)