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: "the menu complexity of one and a half dimensional mechanism design"
  Abstract: We study the menu complexity of optimal and approximately-optimal auctions in the context of the "FedEx" problem, a so-called "one-and-a-half-dimensional" setting where a single bidder has both a value and a deadline for receiving an [FGKK16]. The menu complexity of an auction is equal to the number of distinct (allocation, price) pairs that a bidder might receive [HN13]. We show the following when the bidder has $n$ possible deadlines: #R##N#- Exponential menu complexity is necessary to be exactly optimal: There exist instances where the optimal mechanism has menu complexity is $2^n-1$. This matches exactly the upper bound provided by Fiat et al.'s algorithm, and resolves one of their open questions [FGKK16]. #R##N#- Fully polynomial menu complexity is necessary and sufficient for approximation: For all instances, there exists a mechanism guaranteeing a multiplicative (1-\epsilon)-approximation to the optimal revenue with menu complexity $O(n^{3/2}\sqrt{\frac{\min\{n/\epsilon,\ln(v_{\max})\}}{\epsilon}}) = O(n^2/\epsilon)$, where $v_{\max}$ denotes the largest value in the support of integral distributions. #R##N#- There exist instances where any mechanism guaranteeing a multiplicative $(1-O(1/n^2))$-approximation to the optimal revenue requires menu complexity $\Omega(n^2)$. #R##N#Our main technique is the polygon approximation of concave functions [Rote19], and our results here should be of independent interest. We further show how our techniques can be used to resolve an open question of [DW17] on the menu complexity of optimal auctions for a budget-constrained buyer.

Connected through hyperedge HE-1 (induced by source paper "optimal mechanism design for single minded agents"):
  with members:
    - "a duality based unified approach to bayesian mechanism design"
    - "optimal multi unit mechanisms with private demands"
    - "the menu size complexity of revenue approximation"
    - "optimal mechanisms with simple menus"
    - "mechanism design via optimal transport"
    - "an algorithmic characterization of multi dimensional mechanisms"

Connected through hyperedge HE-2 (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"
    - "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"
    - "simple mechanisms for a subadditive buyer and applications to revenue monotonicity"

Connected through hyperedge HE-3 (induced by source paper "bounds on the menu size of approximately optimal auctions via optimal transport duality"):
  with members:
    - "the menu size complexity of revenue approximation"
    - "optimal auctions with restricted allocations"
    - "selling two goods optimally"
    - "duality and optimality of auctions for uniform distributions"
    - "sampling and representation complexity of revenue maximization"
    - "strong duality for a multiple good monopolist"
    - "mechanism design via optimal transport"
    - "the menu size complexity of 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)