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 "towards more practical linear programming based techniques for algorithmic mechanism design"):
  Abstract: R. Lavy and C. Swamy (FOCS 2005, J. ACM 2011) introduced a general method for obtaining truthful-in-expectation mechanisms from linear programming based approximation algorithms. Due to the use of the Ellipsoid method, a direct implementation of the method is unlikely to be efficient in practice. We propose to use the much simpler and usually faster multiplicative weights update method instead. The simplification comes at the cost of slightly weaker approximation and truthfulness guarantees.

Includes members:
  Member "unified acceleration method for packing and covering problems via diameter reduction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating the held karp bound for metric tsp in nearly linear time")
  Member "fast convex decomposition for truthful social welfare approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mechanism design via dantzig wolfe decomposition")
  Member "optimal auctions via the multiplicative weight method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an efficient e bic to bic transformation and its application to black box reduction in revenue maximization")
  Member "an approximately truthful in expectation mechanism for combinatorial auctions using value queries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a truthful mechanism for the generalized assignment problem")
  Member "approximation algorithms for secondary spectrum auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fpt algorithms for diverse collections of hitting sets")
  Member "on the power of randomization in algorithmic mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of black box mechanism design with priors")
  Member "sequential and parallel algorithms for mixed packing and covering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed assignment with limited communication for multi robot multi target tracking")

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)