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 "parametrized complexity of manipulating sequential allocation"):
  Abstract: The sequential allocation protocol is a simple and popular mechanism to allocate indivisible goods, in which the agents take turns to pick the items according to a predefined sequence. While this protocol is not strategy-proof, it has been shown recently that finding a successful manipulation for an agent is an NP-hard problem (Aziz et al., 2017). Conversely, it is also known that finding an optimal manipulation can be solved in polynomial time in a few cases: if there are only two agents or if the manipulator has a binary or a lexicographic utility function. In this work, we take a parameterized approach to provide several new complexity results on this manipulation problem. Notably, we show that finding an optimal manipulation can be performed in polynomial time if the number of agents is a constant and that it is fixed-parameter tractable with respect to a parameter measuring the distance between the preference rankings of the agents. Moreover, we provide an integer program and a dynamic programming scheme to solve the manipulation problem and we show that a single manipulator can increase the utility of her bundle by a multiplicative factor which is at most 2. Overall, our results show that manipulating the sequential allocation protocol can be performed efficiently for a wide range of instances.

Includes members:
  Member "algorithms for manipulating sequential allocation":
    also connected through other hyperedges:
      (none)
  Member "equilibria in sequential allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithms for manipulating sequential allocation")
  Member "complexity of manipulating sequential allocation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithms for manipulating sequential allocation")
  Member "welfare of sequential allocation mechanisms for indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online fair division a survey")
  Member "possible and necessary allocations via sequential mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online fair division a survey")
  Member "a social welfare optimal sequential allocation procedure":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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)