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 "my fair bandit distributed learning of max min fairness with multi player bandits"):
  Abstract: Consider N cooperative but non-communicating players where each plays one out of M arms for T turns. Players have different utilities for each arm, representable as an N x M matrix. These utilities are unknown to the players. In each turn players receive noisy observations of their utility for their selected arm. However, if any other players selected the same arm that turn, they will all receive zero utility due to the conflict. No other communication or coordination between the players is possible. Our goal is to design a distributed algorithm that learns the matching between players and arms that achieves max-min fairness while minimizing the regret. We present an algorithm and prove that it is regret optimal up to a $\log\log T$ factor. This is the first max-min fairness multi-player bandit algorithm with (near) order optimal regret.

Includes members:
  Member "multi player bandits the adversarial case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coordination without communication optimal regret in two players multi armed bandits")
  Member "competing bandits in matching markets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the gossiping insert eliminate algorithm for multi agent bandits")
  Member "multi player multi armed bandits with non zero rewards on collisions for uncoordinated spectrum access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi user mabs with user dependent rewards for uncoordinated spectrum access")
  Member "individual regret in cooperative nonstochastic multi armed bandits":
    also connected through other hyperedges:
      (none)
  Member "non stochastic multi player multi armed bandits optimal rate with collision information sublinear without":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coordination without communication optimal regret in two players multi armed bandits")
  Member "social learning in multi agent multi armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the gossiping insert eliminate algorithm for multi agent bandits")
  Member "multi player bandits a trekking approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi player multi armed bandits for stable allocation in heterogeneous ad hoc networks")
  Member "multi player multi armed bandits for stable allocation in heterogeneous ad hoc networks":
    also connected through other hyperedges:
      (none)

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)