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: "possible and necessary allocations via sequential mechanisms"
  Abstract: A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item, a set of items, or a subset of items for five natural classes of sequential allocation mechanisms: balanced, recursively balanced, balanced alternating, strictly alternating and all policies. We identify characterizations of allocations produced balanced, recursively balanced, balanced alternating policies and strictly alternating policies respectively, which extend the well-known characterization by Brams and King [2005] for policies without restrictions. In addition, we examine the computational complexity of possible and necessary allocation problems for these classes.

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"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "the peerrank method for peer assessment"
    - "allocation in practice"
    - "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 "the constrained round robin algorithm for fair and efficient allocation"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "fair division under cardinality constraints"
    - "the conference paper assignment problem using order weighted averages to assign indivisible goods"
    - "fair allocation based on diminishing differences"
    - "redividing the cake"
    - "fair assignment of indivisible objects under ordinal preferences"

Connected through hyperedge HE-3 (induced by source paper "algorithms for manipulating sequential allocation"):
  with members:
    - "equilibria in sequential allocation"
    - "complexity of manipulating sequential allocation"
    - "pareto optimal matchings of students to courses in the presence of prerequisites"
    - "manipulating the probabilistic serial rule"
    - "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-4 (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"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "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-5 (induced by source paper "efficiency sequenceability and deal optimality in fair division of indivisible goods"):
  with members:
    - "optimal reallocation under additive and ordinal preferences"
    - "efficiency and sequenceability in fair division of indivisible goods with additive preferences"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"

Connected through hyperedge HE-6 (induced by source paper "deceased organ matching in australia"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "online fair division analysing a food bank problem"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "allocation in practice"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "equilibria in sequential allocation"):
  with members:
    - "complexity of manipulating sequential allocation"
    - "equilibria under the probabilistic serial rule"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "bidding games and efficient allocations"
    - "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-8 (induced by source paper "complexity of manipulating sequential allocation"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "strategyproof quota mechanisms for multiple assignment problems"
    - "combinatorial voter control in elections"
    - "a social welfare optimal sequential allocation procedure"
    - "how to make the most of a shared meal plan the last bite first"

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)