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: "mechanism design without money via stable matching"
  Abstract: Mechanism design without money has a rich history in social choice literature. Due to the strong impossibility theorem by Gibbard and Satterthwaite, exploring domains in which there exist dominant strategy mechanisms is one of the central questions in the field. We propose a general framework, called the generalized packing problem (\gpp), to study the mechanism design questions without payment. The \gpp\ possesses a rich structure and comprises a number of well-studied models as special cases, including, e.g., matroid, matching, knapsack, independent set, and the generalized assignment problem. #R##N#We adopt the agenda of approximate mechanism design where the objective is to design a truthful (or strategyproof) mechanism without money that can be implemented in polynomial time and yields a good approximation to the socially optimal solution. We study several special cases of \gpp, and give constant approximation mechanisms for matroid, matching, knapsack, and the generalized assignment problem. Our result for generalized assignment problem solves an open problem proposed in \cite{DG10}. #R##N#Our main technical contribution is in exploitation of the approaches from stable matching, which is a fundamental solution concept in the context of matching marketplaces, in application to mechanism design. Stable matching, while conceptually simple, provides a set of powerful tools to manage and analyze self-interested behaviors of participating agents. Our mechanism uses a stable matching algorithm as a critical component and adopts other approaches like random sampling and online mechanisms. Our work also enriches the stable matching theory with a new knapsack constrained matching model.

Connected through hyperedge HE-1 (induced by source paper "hiring expert consultants in e healthcare an analytics based two sided matching approach"):
  with members:
    - "hiring expert consultants in e healthcare with budget constraint"
    - "hiring doctors in e healthcare with zero budget"
    - "truthful assignment without money"

Connected through hyperedge HE-2 (induced by source paper "truthful multi unit procurements with budgets"):
  with members:
    - "mechanism design for crowdsourcing an optimal 1 1 e competitive budget feasible mechanism for large markets"
    - "clinching auctions beyond hard budget constraints"
    - "optimal provision after wait in healthcare"
    - "online submodular welfare maximization greedy is optimal"
    - "budget feasible mechanism design from prior free to bayesian"
    - "optimization with demand oracles"
    - "on the approximability of budget feasible mechanisms"
    - "frugal mechanism design via spectral techniques"

Connected through hyperedge HE-3 (induced by source paper "budget feasible mechanism design from prior free to bayesian"):
  with members:
    - "bayesian mechanism design for budget constrained agents"
    - "optimization with demand oracles"
    - "selling privacy at auction"
    - "on the approximability of budget feasible mechanisms"
    - "a note on concentration of submodular functions"
    - "the power of randomness in bayesian optimal mechanism design"
    - "bayesian incentive compatibility via fractional assignments"
    - "budget feasible mechanisms"

Connected through hyperedge HE-4 (induced by source paper "funding games the truth but not the whole truth"):
  with members:
    - "multi unit auctions beyond roberts"
    - "mix and match"
    - "truthful assignment without money"
    - "mechanisms for multi unit auctions"
    - "sum of us strategyproof selection from the selectors"

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)