human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the supermarket game"
  Abstract: A supermarket game is considered with $N$ FCFS queues with unit exponential service rate and global Poisson arrival rate $N \lambda$. Upon arrival each customer chooses a number of queues to be sampled uniformly at random and joins the least loaded sampled queue. Customers are assumed to have cost for both waiting and sampling, and they want to minimize their own expected total cost. #R##N#We study the supermarket game in a mean field model that corresponds to the limit as $N$ converges to infinity in the sense that (i) for a fixed symmetric customer strategy, the joint equilibrium distribution of any fixed number of queues converges as $N \to \infty$ to a product distribution determined by the mean field model and (ii) a Nash equilibrium for the mean field model is an $\epsilon$-Nash equilibrium for the finite $N$ model with $N$ sufficiently large. It is shown that there always exists a Nash equilibrium for $\lambda <1$ and the Nash equilibrium is unique with homogeneous waiting cost for $\lambda^2 \le 1/2$. Furthermore, we find that the action of sampling more queues by some customers has a positive externality on the other customers in the mean field model, but can have a negative externality for finite $N$.

Connected through hyperedge HE-1 (induced by source paper "collaboratively learning the best option on graphs using bounded local memory"):
  with members:
    - "asymptotic response time analysis for multi task parallel jobs"
    - "a distributed learning dynamics in social groups"
    - "delay asymptotics and bounds for multi task parallel jobs"
    - "plurality consensus in the gossip model"
    - "simple dynamics for plurality consensus"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"

Connected through hyperedge HE-2 (induced by source paper "mean field equilibria for resource competition in spatial settings"):
  with members:
    - "pricing and optimization in shared vehicle systems an approximation framework"
    - "incentivizing sharing in realtime d2d streaming networks a mean field game perspective"
    - "equilibria of dynamic games with many players existence approximation and market structure"

Connected through hyperedge HE-3 (induced by source paper "mean field equilibria for competitive exploration in resource sharing settings"):
  with members:
    - "equilibria of dynamic games with many players existence approximation and market structure"

Connected through hyperedge HE-4 (induced by source paper "reward processes and performance simulation in supermarket models with different servers"):
  with members:
    - "block structured supermarket models"
    - "a matrix analytic solution for randomized load balancing models with phase type service times"
    - "the chaos of propagation in a retrial supermarket model"
    - "super exponential solution in markovian supermarket models framework and challenge"
    - "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times"

Connected through hyperedge HE-5 (induced by source paper "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"):
  with members:
    - "analysis of load balancing in large heterogeneous processor sharing systems"

Connected through hyperedge HE-6 (induced by source paper "a mean field game approach to scheduling in cellular systems"):
  with members:
    - "equilibria of dynamic games with many players existence approximation and market structure"

Question: Please tell me which class the center node 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.IT(Information Theory)