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 "bounding the optimal revenue of selling multiple goods"):
  Abstract: Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d.?from a uniform distribution and in the case where they follow independent (but not necessarily identical) exponential distributions. We apply this in order to get in both these settings specific performance guarantees, as functions of the number of items m, for the simple deterministic selling mechanisms studied by Hart and Nisan 1], namely the one that sells the items separately and the one that offers them all in a single bundle.We also propose and study the performance of a natural randomized mechanism for exponential valuations, called Proportional. As an interesting corollary, for the special case where the exponential distributions are also identical, we can derive that offering the goods in a single full bundle is the optimal selling mechanism for any number of items. To our knowledge, this is the first result of its kind: finding a revenue-maximizing auction in an additive setting with arbitrarily many goods.

Includes members:
  Member "approximate revenue maximization with multiple items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "duality and optimality of auctions for uniform distributions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations")
  Member "a simple and approximately optimal mechanism for an additive buyer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "an n to 1 bidder reduction for multi item auctions and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "a note on selling optimally two uniformly distributed goods":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "duality and optimality of auctions for uniform distributions")
  Member "mechanism design via optimal transport":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simple credible and approximately optimal auctions")
  Member "the menu size complexity of auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "the complexity of optimal mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a permutation equivariant neural network architecture for auction design")

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)