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 "tight approximation ratio of anonymous pricing"):
  Abstract: We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, it extracts at least $\frac{1}{2.62}$-fraction of revenue; there is a matching lower-bound example. #R##N#In the unit-demand single-buyer setting, we prove tight approximation ratio between the simplest and optimal deterministic mechanisms: in terms of revenue, uniform pricing admits a $2.62$-approximation of item pricing; we further validate the tightness of this ratio. #R##N#These results settle two open problems asked in~\cite{H13,CD15,AHNPY15,L17,JLTX18}. As an implication, in the single-item setting: we improve the approximation ratio of the second-price auction with anonymous reserve to $2.62$, which breaks the state-of-the-art upper bound of $e \approx 2.72$.

Includes members:
  Member "tight revenue gaps among simple mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "a duality based unified approach to bayesian mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "approximate revenue maximization with multiple items":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "prophet secretary surpassing the 1 1 e barrier":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "simple mechanisms for subadditive buyers via duality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "revenue gaps for discriminatory and anonymous sequential posted pricing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight revenue gaps among simple mechanisms")
  Member "revenue gaps for static and dynamic posted pricing of homogeneous goods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight revenue gaps among simple mechanisms")
  Member "the menu size complexity of revenue approximation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of contracts")

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)