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 "simple and nearly optimal multi item auctions"):
  Abstract: We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multi-item multi-bidder auction problem under two conditions. First, bidders are independent, have additive valuations and are from the same population. Second, every bidder's value distributions of items are independent but not necessarily identical monotone hazard rate (MHR) distributions. For non-i.i.d. bidders, we also provide a PTAS when the number of bidders is small. Prior to our work, even for a single bidder, only constant factor approximations are known. #R##N#Another appealing feature of our mechanism is the simple allocation rule. Indeed, the mechanism we use is either the second-price auction with reserve price on every item individually, or VCG allocation with a few outlying items that requires additional treatments. It is surprising that such simple allocation rules suffice to obtain nearly optimal revenue.

Includes members:
  Member "reducing revenue to welfare maximization approximation algorithms and other generalizations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations")
  Member "bayesian optimal auctions via multi to single agent reduction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "optimal multi dimensional mechanism design reducing revenue to welfare maximization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "an algorithmic characterization of multi dimensional mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "extreme value theorems for optimal multidimensional pricing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "escaping cannibalization correlation robust pricing for a unit demand buyer")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "lp based approximation for personalized reserve prices")

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)