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: "random assignment with multi unit demands"
  Abstract: We consider the multi-unit random assignment problem in which agents express preferences over objects and objects are allocated to agents randomly based on the preferences. The most well-established preference relation to compare random allocations of objects is stochastic dominance (SD) which also leads to corresponding notions of envy-freeness, efficiency, and weak strategyproofness. We show that there exists no rule that is anonymous, neutral, efficient and weak strategyproof. For single-unit random assignment, we show that there exists no rule that is anonymous, neutral, efficient and weak group-strategyproof. We then study a generalization of the PS (probabilistic serial) rule called multi-unit-eating PS and prove that multi-unit-eating PS satisfies envy-freeness, weak strategyproofness, and unanimity.

Connected through hyperedge HE-1 (induced by source paper "incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences"):
  with members:
    - "the impossibility of extending random dictatorship to weak preferences"
    - "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-2 (induced by source paper "egalitarianism of random assignment mechanisms"):
  with members:
    - "random serial dictatorship versus probabilistic serial rule a tale of two random mechanisms"
    - "social welfare in one sided matchings random priority and beyond"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "the computational complexity of random serial dictatorship"
    - "fair allocation without trade"
    - "social welfare in one sided matching markets without money"

Connected through hyperedge HE-3 (induced by source paper "generalizing top trading cycles for housing markets with fractional endowments"):
  with members:
    - "fair assignment of indivisible objects under ordinal preferences"

Connected through hyperedge HE-4 (induced by source paper "structure and complexity of ex post efficient random assignments"):
  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)