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: "allocation of divisible goods under lexicographic preferences"
  Abstract: We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of strategy-proofness (incentive compatibility). In addition (and even when extended to the case of Leontief bundles) it enjoys Pareto efficiency, envy-freeness, and time efficiency.

Connected through hyperedge HE-1 (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"
    - "manipulating the probabilistic serial rule"
    - "equilibria under the probabilistic serial rule"
    - "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-2 (induced by source paper "pareto optimal matchings of students to courses in the presence of prerequisites"):
  with members:
    - "size versus truthfulness in the house allocation problem"
    - "strategyproof quota mechanisms for multiple assignment problems"
    - "possible and necessary allocations via sequential mechanisms"

Connected through hyperedge HE-3 (induced by source paper "participation incentives in randomized social choice"):
  with members:
    - "welfare maximization entices participation"
    - "the computational complexity of random serial dictatorship"

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

Connected through hyperedge HE-5 (induced by source paper "manipulating the probabilistic serial rule"):
  with members:
    - "fair assignment of indivisible objects under ordinal preferences"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-6 (induced by source paper "strategyproof quota mechanisms for multiple assignment problems"):
  with members:
    - "random serial dictatorship versus probabilistic serial rule a tale of two random mechanisms"
    - "a social welfare optimal sequential allocation procedure"

Connected through hyperedge HE-7 (induced by source paper "random serial dictatorship versus probabilistic serial rule a tale of two random mechanisms"):
  with members:
    - "fair assignment of indivisible objects under ordinal preferences"

Connected through hyperedge HE-8 (induced by source paper "strategic aspects of the probabilistic serial rule for the allocation of goods"):
  with members:
    - "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)