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 "efficiency revenue trade offs in auctions"):
  Abstract: When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two criteria, that is, auctions that optimize, say, revenue under the constraint that the welfare is above a given level. If one allows for randomized mechanisms, it is easy to see that there are polynomial-time mechanisms that achieve any point in the trade-off (the Pareto curve) between revenue and welfare. We investigate whether one can achieve the same guarantees using deterministic mechanisms. We provide a negative answer to this question by showing that this is a (weakly) NP-hard problem. On the positive side, we provide polynomial-time deterministic mechanisms that approximate with arbitrary precision any point of the trade-off between these two fundamental objectives for the case of two bidders, even when the valuations are correlated arbitrarily. The major problem left open by our work is whether there is such an algorithm for three or more bidders with independent valuation distributions.

Includes members:
  Member "how good is the chord algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the power of the weighted sum scalarization for approximating multiobjective optimization problems")
  Member "from convex optimization to randomized mechanisms toward optimal combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "optimal auctions with correlated bidders are easy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lp based approximation for personalized reserve prices")
  Member "efficiency loss in revenue optimal auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pricing to maximize revenue and welfare simultaneously in large markets")
  Member "efficiency of revenue optimal mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reserve pricing in repeated second price auctions with strategic bidders")

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)