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: "posted pricing sans discrimination"
  Abstract: In the quest for market mechanisms that are easy to implement, yet close to optimal, few seem as viable as posted pricing. Despite the growing body of impressive results, the performance of most posted price mechanisms however, rely crucially on price discrimination when multiple copies of a good are available. For the more general case with non-linear production costs on each good, hardly anything is known for general multi-good markets. With this in mind, we study a Bayesian setting where the seller can produce any number of copies of a good but faces convex production costs for the same, and buyers arrive sequentially. Our main contribution is a framework for non-discriminatory pricing in the presence of production costs: the framework yields posted price mechanisms with O(1)-approximation factors for fractionally subadditive (XoS) buyers, logarithmic approximations for subadditive buyers, and also extends to settings where the seller is oblivious to buyer valuations. Our work presents the first known results for Bayesian settings with production costs and is among the few posted price mechanisms that do not charge buyers differently for the same good.

Connected through hyperedge HE-1 (induced by source paper "envy free pricing in multi unit markets"):
  with members:
    - "budgetary effects on pricing equilibrium in online markets"
    - "the invisible hand of dynamic market pricing"
    - "combinatorial auctions via posted prices"
    - "the complexity of fairness through equilibrium"
    - "reducing revenue to welfare maximization approximation algorithms and other generalizations"
    - "optimal multi dimensional mechanism design reducing revenue to welfare maximization"
    - "multi unit auctions beyond roberts"
    - "mechanisms for multi unit auctions"

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)