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 "multi unit auctions beyond roberts"):
  Abstract: We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e., are not of the VCG family) and yet approximate the social welfare to within a factor of $1+\epsilon$. For the case of two-item two-bidder auctions we show that these auctions, termed Triage auctions, are the only scalable ones that give an approximation factor better than 2. "Scalable" means that the allocation does not depend on the units in which the valuations are measured. We deduce from this that any scalable computationally-efficient incentive-compatible auction for $m$ items and $n \ge 2$ bidders cannot approximate the social welfare to within a factor better than 2. This is in contrast to arbitrarily good approximations that can be reached under computational constraints alone, and in contrast to the fact that the optimal social welfare can be obtained under incentive constraints alone.

Includes members:
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "roberts theorem with neutrality a social welfare ordering approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how much data is sufficient to learn high performing algorithms")
  Member "mechanisms for multi unit auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "price doubling and item halving robust revenue guarantees for item pricing")
  Member "on the power of randomization in algorithmic mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of black box mechanism design with priors")
  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 "bundling equilibrium in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truthfulness with value maximizing bidders")
  Member "truth revelation in approximately efficient combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faithful implementations of distributed algorithms and control laws")

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)