human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "fair assignment of indivisible objects under ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "swap dynamics in single peaked house markets")
  Member "a social welfare optimal sequential allocation procedure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online fair division a survey")
  Member "a note on the undercut procedure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair allocation based on diminishing differences")
  Member "the computational complexity of random serial dictatorship":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "how to make the most of a shared meal plan the last bite first":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithms for manipulating sequential allocation")
  Member "determining possible and necessary winners under common voting rules given partial orders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of possible winners on partial chains")
  Member "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of possible winners on partial chains")
  Member "towards a dichotomy for the possible winner problem in elections based on scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of possible winners on partial chains")

Question: Please tell me which class the source paper 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)