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: "manipulating the probabilistic serial rule"
  Abstract: The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not immune to manipulative behaviour by the agents. We initiate the study of the computational complexity of an agent manipulating the PS rule. We show that computing an expected utility better response is NP- hard. On the other hand, we present a polynomial-time algorithm to compute a lexicographic best response. For the case of two agents, we show that even an expected utility best response can be computed in polynomial time. Our result for the case of two agents relies on an interesting connection with sequential allocation of discrete objects.

Connected through hyperedge HE-1 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule"):
  with members:
    - "investigating the characteristics of one sided matching mechanisms under various preferences and risk attitudes"
    - "social welfare in one sided matching mechanisms"
    - "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms"
    - "decision theory with resource bounded agents"
    - "the computational complexity of random serial dictatorship"
    - "eliminating the weakest link making manipulation intractable"
    - "social welfare in one sided matching markets without money"
    - "truthful assignment without money"

Connected through hyperedge HE-2 (induced by source paper "online fair division a survey"):
  with members:
    - "facility location problem with capacity constraints algorithmic and mechanism design perspectives"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "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-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"
    - "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-4 (induced by source paper "investigating the characteristics of one sided matching mechanisms under various preferences and risk attitudes"):
  with members:
    - "egalitarianism of random assignment mechanisms"
    - "equilibria under the probabilistic serial rule"
    - "allocation of divisible goods under lexicographic preferences"
    - "strategyproof quota mechanisms for multiple assignment problems"
    - "social welfare in one sided matching mechanisms"
    - "hybrid mechanisms trading off efficiency and strategyproofness in one sided matching"
    - "social welfare in one sided matchings random priority and beyond"
    - "fair assignment of indivisible objects under ordinal preferences"

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

Connected through hyperedge HE-6 (induced by source paper "complexity of manipulating sequential allocation"):
  with members:
    - "strategyproof quota mechanisms for multiple assignment problems"
    - "combinatorial voter control in elections"
    - "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-7 (induced by source paper "social welfare in one sided matching mechanisms"):
  with members:
    - "size versus truthfulness in the house allocation problem"
    - "equilibria under the probabilistic serial rule"
    - "efficiency of truthful and symmetric mechanisms in one sided matching"
    - "strategic aspects of the probabilistic serial rule for the allocation of goods"
    - "social welfare in one sided matchings random priority and beyond"
    - "welfare maximization and truthfulness in mechanism design with ordinal preferences"
    - "truthful approximations to range voting"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-8 (induced by source paper "equilibria under the probabilistic serial rule"):
  with members:
    - "generating single peaked votes"
    - "allocation of divisible goods under lexicographic preferences"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "the computational complexity of random serial dictatorship"

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