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 "non optimal mechanism design"):
  Abstract: The optimal allocation of resources in complex environments—like allocation of dynamic wireless spectrum, cloud computing services, and Internet advertising—is computationally challenging even given the true preferences of the participants. In the theory and practice of optimization in complex environments, a wide variety of special and general purpose algorithms have been developed; these algorithms produce outcomes that are satisfactory but not generally optimal or incentive compatible. This paper develops a very simple approach for converting any, potentially non-optimal, algorithm for optimization given the true participant preferences, into a Bayesian incentive compatible mechanism that weakly improves social welfare and revenue. (JEL D82, H82, L82)

Includes members:
  Member "understanding incentives mechanism design becomes algorithm design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of contracts")
  Member "on the efficiency of the walrasian mechanism":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the pareto frontier of inefficiency in mechanism design")
  Member "composable and efficient mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "sequential posted pricing and multi parameter mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal auctions vs anonymous pricing beyond linear utility")
  Member "bayesian incentive compatibility via fractional assignments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an efficient e bic to bic transformation and its application to black box reduction in revenue maximization")
  Member "budget constrained auctions with heterogeneous items":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations")
  Member "price of anarchy for greedy auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proportional dynamics in exchange economies")
  Member "algorithmic pricing via virtual valuations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "simple credible and approximately optimal 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)