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 "the perils of exploration under competition a computational modeling approach"):
  Abstract: We empirically study the interplay between exploration and competition. Systems that learn from interactions with users often engage in exploration: making potentially suboptimal decisions in order to acquire new information for future decisions. However, when multiple systems are competing for the same market of users, exploration may hurt a system's reputation in the near term, with adverse competitive effects. In particular, a system may enter a "death spiral", when the short-term reputation cost decreases the number of users for the system to learn from, which degrades its performance relative to competition and further decreases its market share. #R##N#We ask whether better exploration algorithms are incentivized under competition. We run extensive numerical experiments in a stylized duopoly model in which two firms deploy multi-armed bandit algorithms and compete for myopic users. We find that duopoly and monopoly tend to favor a primitive "greedy algorithm" that does not explore and leads to low consumer welfare, whereas a temporary monopoly (a duopoly with an early entrant) may incentivize better bandit algorithms and lead to higher consumer welfare. Our findings shed light on the first-mover advantage in the digital economy by exploring the role that data can play as a barrier to entry in online markets.

Includes members:
  Member "competing bandits learning under competition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the gossiping insert eliminate algorithm for multi agent bandits")
  Member "a tutorial on thompson sampling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "selling to a no regret buyer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "grinding the space learning to classify against strategic agents")
  Member "making contextual decisions with low technical debt":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "bayesian incentive compatible bandit exploration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incentivizing exploration with selective data disclosure")
  Member "adaptive contract design for crowdsourcing markets bandit algorithms for repeated principal agent problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of contracts")
  Member "learning prices for repeated auctions with strategic buyers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic reserve prices for repeated auctions learning from bids")
  Member "regret analysis of stochastic and nonstochastic multi armed bandit problems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi source domain adaptation for text classification via distancenet bandits")

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)