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 "equilibria in sequential allocation"):
  Abstract: Sequential allocation is a simple mechanism for sharing multiple indivisible items. We study strategic behavior in sequential allocation. In particular, we consider Nash dynamics, as well as the computation and Pareto optimality of pure equilibria, and Stackelberg strategies. We first demonstrate that, even for two agents, better responses can cycle. We then present a linear-time algorithm that returns a profile (which we call the "bluff profile") that is in pure Nash equilibrium. Interestingly, the outcome of the bluff profile is the same as that of the truthful profile and the profile is in pure Nash equilibrium for \emph{all} cardinal utilities consistent with the ordinal preferences. We show that the outcome of the bluff profile is Pareto optimal with respect to pairwise comparisons. In contrast, we show that an assignment may not be Pareto optimal with respect to pairwise comparisons even if it is a result of a preference profile that is in pure Nash equilibrium for all utilities consistent with ordinal preferences. Finally, we present a dynamic program to compute an optimal Stackelberg strategy for two agents, where the second agent has a constant number of distinct values for the items.

Includes members:
  Member "complexity of manipulating sequential allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithms for manipulating sequential allocation")
  Member "equilibria under the probabilistic serial rule":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "investigating the characteristics of one sided matching mechanisms under various preferences and risk attitudes")
  Member "possible and necessary allocations via sequential mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online fair division a survey")
  Member "fair assignment of indivisible objects under ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "swap dynamics in single peaked house markets")
  Member "bidding games and efficient allocations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "infinite duration poorman bidding games")
  Member "a social welfare optimal sequential allocation procedure":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online fair division a survey")
  Member "how to make the most of a shared meal plan the last bite first":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithms for manipulating sequential allocation")

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.GT(Computer Science and Game Theory)