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 "online learning of optimal bidding strategy in repeated multi commodity auctions"):
  Abstract: We study the online learning problem of a bidder who participates in repeated auctions. With the goal of maximizing his T-period payoff, the bidder determines the optimal allocation of his budget among his bids for $K$ goods at each period. As a bidding strategy, we propose a polynomial-time algorithm, inspired by the dynamic programming approach to the knapsack problem. The proposed algorithm, referred to as dynamic programming on discrete set (DPDS), achieves a regret order of $O(\sqrt{T\log{T}})$. By showing that the regret is lower bounded by $\Omega(\sqrt{T})$ for any strategy, we conclude that DPDS is order optimal up to a $\sqrt{\log{T}}$ term. We evaluate the performance of DPDS empirically in the context of virtual trading in wholesale electricity markets by using historical data from the New York market. Empirical results show that DPDS consistently outperforms benchmark heuristic methods that are derived from machine learning and online learning approaches.

Includes members:
  Member "online learning in repeated auctions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "corrupted multidimensional binary search learning in the presence of irrational agents")
  Member "learning in auctions regret is hard envy is easy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning reserve prices in second price auctions")
  Member "bandits and experts in metric spaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "learning prices for repeated auctions with strategic buyers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic reserve prices for repeated auctions learning from bids")
  Member "budget optimization for sponsored search censored learning in mdps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "achieving fairness in the stochastic multi armed bandit problem")
  Member "sharp dichotomies for regret minimization in metric spaces":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithmic bidding for virtual trading in electricity markets")
  Member "online convex optimization in the bandit setting gradient descent without a gradient":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "accelerating reinforcement learning with a directional gaussian smoothing evolution strategy")

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)