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 "on the approximability of budget feasible mechanisms"):
  Abstract: Budget feasible mechanisms, recently initiated by Singer (FOCS 2010), extend algorithmic mechanism design problems to a realistic setting with a budget constraint. We consider the problem of designing truthful budget feasible mechanisms for general submodular functions: we give a randomized mechanism with approximation ratio $7.91$ (improving the previous best-known result 112), and a deterministic mechanism with approximation ratio $8.34$. Further we study the knapsack problem, which is special submodular function, give a $2+\sqrt{2}$ approximation deterministic mechanism (improving the previous best-known result 6), and a 3 approximation randomized mechanism. We provide a similar result for an extended knapsack problem with heterogeneous items, where items are divided into groups and one can pick at most one item from each group. #R##N#Finally we show a lower bound of approximation ratio of $1+\sqrt{2}$ for deterministic mechanisms and 2 for randomized mechanisms for knapsack, as well as the general submodular functions. Our lower bounds are unconditional, which do not rely on any computational or complexity assumptions.

Includes members:
  Member "sequential posted pricing and multi parameter mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal auctions vs anonymous pricing beyond linear utility")
  Member "frugal mechanism design via spectral techniques":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal budget feasible mechanisms for additive valuations")
  Member "budget feasible mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "frugal and truthful auctions for vertex covers flows and cuts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal budget feasible mechanisms for additive valuations")
  Member "a note on the power of truthful approximation mechanisms":
    also connected through other hyperedges:
      (none)
  Member "budget constrained auctions with heterogeneous items":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)