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: "welfare of sequential allocation mechanisms for indivisible goods"
  Abstract: Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods. Agents take turns, according to a policy, to pick items. Sequential allocation is guaranteed to return an allocation which is efficient but may not have an optimal social welfare. We consider therefore the relation between welfare and efficiency. We study the (computational) questions of what welfare is possible or necessary depending on the choice of policy. We also consider a novel control problem in which the chair chooses a policy to improve social welfare.

Connected through hyperedge HE-1 (induced by source paper "online fair division a survey"):
  with members:
    - "facility location problem with capacity constraints algorithmic and mechanism design perspectives"
    - "manipulating the probabilistic serial rule"
    - "the peerrank method for peer assessment"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "online cake cutting"

Connected through hyperedge HE-2 (induced by source paper "parametrized complexity of manipulating sequential allocation"):
  with members:
    - "algorithms for manipulating sequential allocation"
    - "equilibria in sequential allocation"
    - "complexity of manipulating sequential allocation"
    - "possible and necessary allocations via sequential mechanisms"
    - "a social welfare optimal sequential allocation procedure"
    - "how to make the most of a shared meal plan the last bite first"

Connected through hyperedge HE-3 (induced by source paper "deceased organ matching in australia"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "online fair division analysing a food bank problem"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"

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.AI(Artificial Intelligence)