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 "budget feasible mechanisms on matroids"):
  Abstract: Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where each ground (indivisible) element is a selfish agent. The cost of each element (i.e., for selling the item or performing a service) is only known to the element itself. There is a buyer with a budget having additive valuations over the set of elements $E$. The goal is to design an incentive compatible (truthful) budget feasible mechanism which procures an independent set of the matroid under the given budget that yields the largest value possible to the buyer. Our result is a deterministic, polynomial-time, individually rational, truthful and budget feasible mechanism with $4$-approximation to the optimal independent set. Then, we extend our mechanism to the setting of matroid intersections in which the goal is to procure common independent sets from multiple matroids. We show that, given a polynomial time deterministic blackbox that returns $\alpha-$approximation solutions to the matroid intersection problem, there exists a deterministic, polynomial time, individually rational, truthful and budget feasible mechanism with $(3\alpha +1)-$approximation to the optimal common independent set.

Includes members:
  Member "mechanism design for crowdsourcing an optimal 1 1 e competitive budget feasible mechanism for large markets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "truthful multi unit procurements with budgets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximately maximizing the broker s profit in a two sided market")
  Member "polyhedral clinching auctions and the adwords polytope":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pricing in resource allocation games based on lagrangean duality and convexification")
  Member "budget feasible mechanism design from prior free to bayesian":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "predict and match prophet inequalities with uncertain supply")
  Member "on the approximability of budget feasible mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "budget feasible mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")

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)