human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations"):
  with members:
    - "on optimal mechanisms in the two item single buyer unit demand setting"
    - "a duality based unified approach to bayesian mechanism design"
    - "approximate revenue maximization with multiple items"
    - "simple mechanisms for subadditive buyers via duality"
    - "the menu size complexity of revenue approximation"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "optimal auctions with restricted allocations"
    - "bounding the optimal revenue of selling multiple goods"

Connected through hyperedge HE-2 (induced by source paper "an efficient e bic to bic transformation and its application to black box reduction in revenue maximization"):
  with members:
    - "multi item mechanisms without item independence learnability via robustness"
    - "the complexity of black box mechanism design with priors"
    - "approximation schemes for a buyer with independent items via symmetries"
    - "a duality based unified approach to bayesian mechanism design"
    - "bernoulli factories and black box reductions in mechanism design"
    - "simple mechanisms for subadditive buyers via duality"
    - "revenue maximization and ex post budget constraints"
    - "mechanism design for subadditive agents via an ex ante relaxation"

Connected through hyperedge HE-3 (induced by source paper "simple mechanisms for profit maximization in multi item auctions"):
  with members:
    - "the best of both worlds asymptotically efficient mechanisms with a guarantee on the expected gains from trade"
    - "a duality based unified approach to bayesian mechanism design"
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "approximate revenue maximization with multiple items"
    - "simple mechanisms for subadditive buyers via duality"
    - "almost efficient mechanisms for bilateral trading"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "approximately efficient two sided combinatorial auctions"

Connected through hyperedge HE-4 (induced by source paper "approximation schemes for a unit demand buyer with independent items via symmetries"):
  with members:
    - "a duality based unified approach to bayesian mechanism design"
    - "optimal deterministic mechanisms for an additive buyer"
    - "approximate revenue maximization with multiple items"
    - "the menu complexity of one and a half dimensional mechanism design"
    - "simple mechanisms for subadditive buyers via duality"
    - "the menu size complexity of revenue approximation"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "settling the complexity of computing approximate two player nash equilibria"

Connected through hyperedge HE-5 (induced by source paper "a duality based unified approach to bayesian mechanism design"):
  with members:
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "approximate revenue maximization with multiple items"
    - "the value of information concealment"
    - "simple mechanisms for subadditive buyers via duality"
    - "revenue maximization and ex post budget constraints"
    - "the competition complexity of auctions a bulow klemperer result for multi dimensional bidders"
    - "a simple and approximately optimal mechanism for a buyer with complements"
    - "mechanism design for subadditive agents via an ex ante relaxation"

Connected through hyperedge HE-6 (induced by source paper "99 revenue via enhanced competition"):
  with members:
    - "a duality based unified approach to bayesian mechanism design"
    - "approximate revenue maximization with multiple items"
    - "on the competition complexity of dynamic mechanism design"
    - "on revenue monotonicity in combinatorial auctions"
    - "simple mechanisms for subadditive buyers via duality"
    - "the competition complexity of auctions a bulow klemperer result for multi dimensional bidders"
    - "reaping the benefits of bundling under high production costs"
    - "mechanism design for subadditive agents via an ex ante relaxation"

Connected through hyperedge HE-7 (induced by source paper "third party data providers ruin simple mechanisms"):
  with members:
    - "a duality based unified approach to bayesian mechanism design"
    - "approximate revenue maximization with multiple items"
    - "simple mechanisms for subadditive buyers via duality"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "on the computational complexity of optimal simple mechanisms"
    - "simple mechanisms for a subadditive buyer and applications to revenue monotonicity"
    - "mixture selection mechanism design and signaling"
    - "a simple and approximately optimal mechanism for an additive buyer"

Connected through hyperedge HE-8 (induced by source paper "learning multi item auctions with or without samples"):
  with members:
    - "a duality based unified approach to bayesian mechanism design"
    - "simple mechanisms for subadditive buyers via duality"
    - "revenue maximization and ex post budget constraints"
    - "learning simple auctions"
    - "efficient empirical revenue maximization in single parameter auction environments"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "the sample complexity of revenue maximization"
    - "the sample complexity of auctions with side information"

Question: Please tell me which class the center node 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)