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 vcg mechanism for bayesian scheduling"):
  Abstract: We study the problem of scheduling $m$ tasks to $n$ selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines. We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of $O\left(\frac{\ln n}{\ln \ln n}\right)$. This improves significantly on the previously best known bound of $O\left(\frac{m}{n}\right)$ for prior-independent mechanisms, given by Chawla et al. [STOC'13] under the additional assumption of Monotone Hazard Rate (MHR) distributions. Although we demonstrate that this is in general tight, if we do maintain the MHR assumption, then we get improved, (small) constant bounds for $m\geq n\ln n$ i.i.d. tasks, while we also identify a sufficient condition on the distribution that yields a constant approximation ratio regardless of the number of tasks.

Includes members:
  Member "bayesian truthful mechanisms for job scheduling from bi criterion approximation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "persuasion and incentives through the lens of duality")
  Member "prophet inequalities with limited information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "prior independent mechanisms for scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the vickrey auction with a single duplicate bidder approximates the optimal revenue")
  Member "a unified approach to truthful scheduling on related machines":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the nisan ronen conjecture for submodular valuations")
  Member "a deterministic truthful ptas for scheduling related machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the nisan ronen conjecture for submodular valuations")
  Member "an improved randomized truthful mechanism for scheduling unrelated machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the nisan ronen conjecture for submodular valuations")
  Member "computationally feasible vcg mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "machine learning powered iterative combinatorial auctions")

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)