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: "roberts theorem with neutrality a social welfare ordering approach"
  Abstract: We consider dominant strategy implementation in private values settings, when agents have multi-dimensional types, the set of alternatives is finite, monetary transfers are allowed, and agents have quasi-linear utilities. We show that any implementable and neutral social choice function must be a weighted welfare maximizer if the type space of every agent is an $m$-dimensional open interval, where $m$ is the number of alternatives. When the type space of every agent is unrestricted, Roberts' theorem with neutrality \cite{Roberts79} becomes a corollary to our result. Our proof technique uses a {\em social welfare ordering} approach, commonly used in aggregation literature in social choice theory. We also prove the general (affine maximizer) version of Roberts' theorem for unrestricted type spaces of agents using this approach.

Connected through hyperedge HE-1 (induced by source paper "how much data is sufficient to learn high performing algorithms"):
  with members:
    - "dispersion for data driven algorithm design online learning and private optimization"
    - "a general theory of sample complexity for multi item profit maximization"
    - "efficiency and budget balance in general quasi linear domains"
    - "a pac approach to application specific algorithm selection"
    - "a bayesian approach to tackling hard computational problems"
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-2 (induced by source paper "efficiency and budget balance in general quasi linear domains"):
  with members:
    - "complexity of mechanism design"
    - "redistribution mechanisms for assignment of heterogeneous objects"
    - "randomized strategyproof mechanisms for facility location and the mini sum of squares objective"

Connected through hyperedge HE-3 (induced by source paper "multi unit auctions beyond roberts"):
  with members:
    - "an impossibility result for truthful combinatorial auctions with submodular valuations"
    - "mechanisms for multi unit auctions"
    - "on the power of randomization in algorithmic mechanism design"
    - "a deterministic truthful ptas for scheduling related machines"
    - "bundling equilibrium in combinatorial auctions"
    - "truth revelation in approximately efficient combinatorial 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)